Algorithmen zum Auffinden längster Kreise in Graphen:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
1988
|
| Schlagwörter: | |
| Umfang: | 154 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV001846721 | ||
| 003 | DE-604 | ||
| 005 | 20040330 | ||
| 007 | t| | ||
| 008 | 890524s1988 xx m||| 00||| ger d | ||
| 035 | |a (OCoLC)645255294 | ||
| 035 | |a (DE-599)BVBBV001846721 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-19 |a DE-91 |a DE-384 |a DE-703 |a DE-739 |a DE-355 |a DE-824 |a DE-29T |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a MAT 056d |2 stub | ||
| 100 | 1 | |a Schiermeyer, Ingo |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithmen zum Auffinden längster Kreise in Graphen |c vorgelegt von Ingo Schiermeyer |
| 264 | 1 | |c 1988 | |
| 300 | |a 154 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Aachen, Techn. Hochsch., Diss., 1988 | ||
| 650 | 0 | 7 | |a Hamiltonscher Graph |0 (DE-588)4158956-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kreis |0 (DE-588)4032962-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Hamiltonscher Graph |0 (DE-588)4158956-7 |D s |
| 689 | 0 | 1 | |a Kreis |0 (DE-588)4032962-8 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 940 | 1 | |q TUB-nveb | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001224396 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 DA 89 1238 |
|---|---|
| DE-BY-TUM_katkey | 125970 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | 040005054944 |
| _version_ | 1821940083956121603 |
| any_adam_object | |
| author | Schiermeyer, Ingo |
| author_facet | Schiermeyer, Ingo |
| author_role | aut |
| author_sort | Schiermeyer, Ingo |
| author_variant | i s is |
| building | Verbundindex |
| bvnumber | BV001846721 |
| classification_tum | MAT 056d |
| ctrlnum | (OCoLC)645255294 (DE-599)BVBBV001846721 |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01285nam a2200373 c 4500</leader><controlfield tag="001">BV001846721</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040330 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890524s1988 xx m||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)645255294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001846721</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-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</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-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 056d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schiermeyer, Ingo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmen zum Auffinden längster Kreise in Graphen</subfield><subfield code="c">vorgelegt von Ingo Schiermeyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">154 S.</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">Aachen, Techn. Hochsch., Diss., 1988</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hamiltonscher Graph</subfield><subfield code="0">(DE-588)4158956-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kreis</subfield><subfield code="0">(DE-588)4032962-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Hamiltonscher Graph</subfield><subfield code="0">(DE-588)4158956-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kreis</subfield><subfield code="0">(DE-588)4032962-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001224396</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV001846721 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T07:42:34Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001224396 |
| oclc_num | 645255294 |
| open_access_boolean | |
| owner | DE-12 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-384 DE-703 DE-739 DE-355 DE-BY-UBR DE-824 DE-29T DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-384 DE-703 DE-739 DE-355 DE-BY-UBR DE-824 DE-29T DE-634 DE-83 DE-11 DE-188 |
| physical | 154 S. |
| psigel | TUB-nveb |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| spellingShingle | Schiermeyer, Ingo Algorithmen zum Auffinden längster Kreise in Graphen Hamiltonscher Graph (DE-588)4158956-7 gnd Kreis (DE-588)4032962-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4158956-7 (DE-588)4032962-8 (DE-588)4001183-5 (DE-588)4113937-9 |
| title | Algorithmen zum Auffinden längster Kreise in Graphen |
| title_auth | Algorithmen zum Auffinden längster Kreise in Graphen |
| title_exact_search | Algorithmen zum Auffinden längster Kreise in Graphen |
| title_full | Algorithmen zum Auffinden längster Kreise in Graphen vorgelegt von Ingo Schiermeyer |
| title_fullStr | Algorithmen zum Auffinden längster Kreise in Graphen vorgelegt von Ingo Schiermeyer |
| title_full_unstemmed | Algorithmen zum Auffinden längster Kreise in Graphen vorgelegt von Ingo Schiermeyer |
| title_short | Algorithmen zum Auffinden längster Kreise in Graphen |
| title_sort | algorithmen zum auffinden langster kreise in graphen |
| topic | Hamiltonscher Graph (DE-588)4158956-7 gnd Kreis (DE-588)4032962-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Hamiltonscher Graph Kreis Algorithmus Hochschulschrift |
| work_keys_str_mv | AT schiermeyeringo algorithmenzumauffindenlangsterkreiseingraphen |
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 DA 89 1238
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |