Fastest paths, almost disjoint paths, and beyond:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
München
Verlag Dr. Hut
2023
|
| Ausgabe: | 1. Auflage |
| Schriftenreihe: | Mathematik
|
| Schlagworte: | |
| Beschreibung: | x, 163 Seiten Diagramme |
| ISBN: | 9783843952170 |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV048979937 | ||
| 003 | DE-604 | ||
| 005 | 20230731 | ||
| 007 | t | ||
| 008 | 230531s2023 gw |||| m||| 00||| eng d | ||
| 015 | |a 23,N06 |2 dnb | ||
| 016 | 7 | |a 1280123974 |2 DE-101 | |
| 020 | |a 9783843952170 |9 978-3-8439-5217-0 | ||
| 035 | |a (OCoLC)1381302430 | ||
| 035 | |a (DE-599)DNB1280123974 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BY | ||
| 049 | |a DE-19 |a DE-12 | ||
| 100 | 1 | |a Bergner, Tim |e Verfasser |0 (DE-588)1292909862 |4 aut | |
| 245 | 1 | 0 | |a Fastest paths, almost disjoint paths, and beyond |c Tim Bergner |
| 250 | |a 1. Auflage | ||
| 264 | 1 | |a München |b Verlag Dr. Hut |c 2023 | |
| 300 | |a x, 163 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Mathematik | |
| 502 | |b Dissertation |c Technische Universität Kaiserslautern |d 2022 | ||
| 653 | |a Combinatorial Optimization | ||
| 653 | |a Complexity of Computation | ||
| 653 | |a Graphs and Networks | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 710 | 2 | |a Verlag Dr. Hut (München) |0 (DE-588)10174118-2 |4 pbl | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034243420 | ||
Datensatz im Suchindex
| _version_ | 1804185226090381312 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bergner, Tim |
| author_GND | (DE-588)1292909862 |
| author_facet | Bergner, Tim |
| author_role | aut |
| author_sort | Bergner, Tim |
| author_variant | t b tb |
| building | Verbundindex |
| bvnumber | BV048979937 |
| ctrlnum | (OCoLC)1381302430 (DE-599)DNB1280123974 |
| edition | 1. Auflage |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01217nam a22003858c 4500</leader><controlfield tag="001">BV048979937</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230731 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">230531s2023 gw |||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">23,N06</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1280123974</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783843952170</subfield><subfield code="9">978-3-8439-5217-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1381302430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1280123974</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BY</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bergner, Tim</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1292909862</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fastest paths, almost disjoint paths, and beyond</subfield><subfield code="c">Tim Bergner</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Auflage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Verlag Dr. Hut</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 163 Seiten</subfield><subfield code="b">Diagramme</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="490" ind1="0" ind2=" "><subfield code="a">Mathematik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Kaiserslautern</subfield><subfield code="d">2022</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorial Optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complexity of Computation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graphs and Networks</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="710" ind1="2" ind2=" "><subfield code="a">Verlag Dr. Hut (München)</subfield><subfield code="0">(DE-588)10174118-2</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034243420</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV048979937 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T22:05:01Z |
| indexdate | 2024-07-10T09:51:52Z |
| institution | BVB |
| institution_GND | (DE-588)10174118-2 |
| isbn | 9783843952170 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034243420 |
| oclc_num | 1381302430 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-12 |
| owner_facet | DE-19 DE-BY-UBM DE-12 |
| physical | x, 163 Seiten Diagramme |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Verlag Dr. Hut |
| record_format | marc |
| series2 | Mathematik |
| spelling | Bergner, Tim Verfasser (DE-588)1292909862 aut Fastest paths, almost disjoint paths, and beyond Tim Bergner 1. Auflage München Verlag Dr. Hut 2023 x, 163 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Mathematik Dissertation Technische Universität Kaiserslautern 2022 Combinatorial Optimization Complexity of Computation Graphs and Networks (DE-588)4113937-9 Hochschulschrift gnd-content Verlag Dr. Hut (München) (DE-588)10174118-2 pbl |
| spellingShingle | Bergner, Tim Fastest paths, almost disjoint paths, and beyond |
| subject_GND | (DE-588)4113937-9 |
| title | Fastest paths, almost disjoint paths, and beyond |
| title_auth | Fastest paths, almost disjoint paths, and beyond |
| title_exact_search | Fastest paths, almost disjoint paths, and beyond |
| title_exact_search_txtP | Fastest paths, almost disjoint paths, and beyond |
| title_full | Fastest paths, almost disjoint paths, and beyond Tim Bergner |
| title_fullStr | Fastest paths, almost disjoint paths, and beyond Tim Bergner |
| title_full_unstemmed | Fastest paths, almost disjoint paths, and beyond Tim Bergner |
| title_short | Fastest paths, almost disjoint paths, and beyond |
| title_sort | fastest paths almost disjoint paths and beyond |
| topic_facet | Hochschulschrift |
| work_keys_str_mv | AT bergnertim fastestpathsalmostdisjointpathsandbeyond AT verlagdrhutmunchen fastestpathsalmostdisjointpathsandbeyond |