Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
1979
|
| Schlagworte: | |
| Beschreibung: | 141 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV003048578 | ||
| 003 | DE-604 | ||
| 005 | 20080612 | ||
| 007 | t | ||
| 008 | 900725s1979 d||| m||| 00||| ger d | ||
| 035 | |a (OCoLC)252350996 | ||
| 035 | |a (DE-599)BVBBV003048578 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-384 |a DE-473 |a DE-703 |a DE-739 |a DE-355 |a DE-824 |a DE-29T |a DE-19 |a DE-188 | ||
| 100 | 1 | |a Weigand, Michael M. |d 1949- |e Verfasser |0 (DE-588)142030325 |4 aut | |
| 245 | 1 | 0 | |a Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| 264 | 1 | |c 1979 | |
| 300 | |a 141 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Stuttgart, Univ., Diss., 1979 | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001910016 | ||
Datensatz im Suchindex
| _version_ | 1804117337316524032 |
|---|---|
| any_adam_object | |
| author | Weigand, Michael M. 1949- |
| author_GND | (DE-588)142030325 |
| author_facet | Weigand, Michael M. 1949- |
| author_role | aut |
| author_sort | Weigand, Michael M. 1949- |
| author_variant | m m w mm mmw |
| building | Verbundindex |
| bvnumber | BV003048578 |
| ctrlnum | (OCoLC)252350996 (DE-599)BVBBV003048578 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01124nam a2200325 c 4500</leader><controlfield tag="001">BV003048578</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080612 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1979 d||| m||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)252350996</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003048578</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Weigand, Michael M.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142030325</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">141 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Stuttgart, Univ., Diss., 1979</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001910016</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV003048578 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:52:48Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001910016 |
| oclc_num | 252350996 |
| open_access_boolean | |
| owner | DE-384 DE-473 DE-BY-UBG DE-703 DE-739 DE-355 DE-BY-UBR DE-824 DE-29T DE-19 DE-BY-UBM DE-188 |
| owner_facet | DE-384 DE-473 DE-BY-UBG DE-703 DE-739 DE-355 DE-BY-UBR DE-824 DE-29T DE-19 DE-BY-UBM DE-188 |
| physical | 141 S. graph. Darst. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| spelling | Weigand, Michael M. 1949- Verfasser (DE-588)142030325 aut Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen 1979 141 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Stuttgart, Univ., Diss., 1979 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graphentheorie (DE-588)4113782-6 s Kürzester-Weg-Problem (DE-588)4138403-9 s DE-604 |
| spellingShingle | Weigand, Michael M. 1949- Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen Graphentheorie (DE-588)4113782-6 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4138403-9 (DE-588)4113937-9 |
| title | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_auth | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_exact_search | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_full | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_fullStr | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_full_unstemmed | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_short | Algorithmen zur Bestimmung k-kürzester Wege in einem Graphen |
| title_sort | algorithmen zur bestimmung k kurzester wege in einem graphen |
| topic | Graphentheorie (DE-588)4113782-6 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| topic_facet | Graphentheorie Kürzester-Weg-Problem Hochschulschrift |
| work_keys_str_mv | AT weigandmichaelm algorithmenzurbestimmungkkurzesterwegeineinemgraphen |