Classic graph problems made temporal – a parameterized complexity analysis
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Universitätsverlag der TU Berlin
2020
|
| Schriftenreihe: | Foundations of Computing
13 |
| Schlagworte: | |
| Online-Zugang: | kostenfrei Inhaltstext Inhaltstext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV047076508 | ||
| 003 | DE-604 | ||
| 005 | 20210126 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210104s2020 gw a||| om||| 00||| eng d | ||
| 015 | |a 20,N52 |2 dnb | ||
| 020 | |a 9783798331730 |9 978-3-7983-3173-0 | ||
| 024 | 7 | |a 10.14279/depositonce-10551 |2 doi | |
| 035 | |a (OCoLC)1230235741 | ||
| 035 | |a (DE-599)BVBBV047076508 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-83 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |8 1\p |a 004 |2 23sdnb | ||
| 100 | 1 | |a Molter, Hendrik |e Verfasser |0 (DE-588)1224422430 |4 aut | |
| 245 | 1 | 0 | |a Classic graph problems made temporal – a parameterized complexity analysis |c Hendrik Molter |
| 263 | |a 202011 | ||
| 264 | 1 | |a Berlin |b Universitätsverlag der TU Berlin |c 2020 | |
| 300 | |a 1 Online-Ressource (xii, 206 Seiten) |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Foundations of Computing |v 13 | |
| 502 | |b Dissertation |c Technische Universität Berlin |d 2019 | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
| 653 | |a temporal graphs | ||
| 653 | |a temporal paths | ||
| 653 | |a temporal matchings | ||
| 653 | |a temporal coloring | ||
| 653 | |a temporal cliques | ||
| 653 | |a temporal cluster editing | ||
| 653 | |a parameterized algorithms | ||
| 653 | |a temporale Graphen | ||
| 653 | |a temporale Pfade | ||
| 653 | |a temporale Matchings | ||
| 653 | |a temporale Knotenfärbung | ||
| 653 | |a temporale Cliquen | ||
| 653 | |a temporales Cluster editieren | ||
| 653 | |a parametrisierte Algorithmen | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
| 689 | 0 | 1 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 710 | 2 | |a Technische Universität Berlin |b Universitätsbibliothek |0 (DE-588)5053182-7 |4 pbl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-7983-3172-3 |w (DE-604)BV047076477 |
| 830 | 0 | |a Foundations of Computing |v 13 |w (DE-604)BV044943050 |9 13 | |
| 856 | 4 | 0 | |u https://doi.org/10.14279/depositonce-10551 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=2&dok_ext=htm |3 Inhaltstext |
| 912 | |a ebook | ||
| 883 | 1 | |8 1\p |a vlb |d 20201216 |q DE-101 |u https://d-nb.info/provenance/plan#vlb | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032483449 | |
Datensatz im Suchindex
| _version_ | 1819310136496226304 |
|---|---|
| any_adam_object | |
| author | Molter, Hendrik |
| author_GND | (DE-588)1224422430 |
| author_facet | Molter, Hendrik |
| author_role | aut |
| author_sort | Molter, Hendrik |
| author_variant | h m hm |
| building | Verbundindex |
| bvnumber | BV047076508 |
| classification_rvk | ST 134 |
| collection | ebook |
| ctrlnum | (OCoLC)1230235741 (DE-599)BVBBV047076508 |
| discipline | Informatik |
| doi_str_mv | 10.14279/depositonce-10551 |
| format | Thesis Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02782nam a22006858cb4500</leader><controlfield tag="001">BV047076508</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210126 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210104s2020 gw a||| om||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">20,N52</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798331730</subfield><subfield code="9">978-3-7983-3173-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.14279/depositonce-10551</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1230235741</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047076508</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-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">1\p</subfield><subfield code="a">004</subfield><subfield code="2">23sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Molter, Hendrik</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1224422430</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Classic graph problems made temporal – a parameterized complexity analysis</subfield><subfield code="c">Hendrik Molter</subfield></datafield><datafield tag="263" ind1=" " ind2=" "><subfield code="a">202011</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 206 Seiten)</subfield><subfield code="b">Illustrationen, 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of Computing</subfield><subfield code="v">13</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2019</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">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal paths</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal matchings</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal coloring</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal cliques</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporal cluster editing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parameterized algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporale Graphen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporale Pfade</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporale Matchings</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporale Knotenfärbung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporale Cliquen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">temporales Cluster editieren</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parametrisierte Algorithmen</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">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Technische Universität Berlin</subfield><subfield code="b">Universitätsbibliothek</subfield><subfield code="0">(DE-588)5053182-7</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-7983-3172-3</subfield><subfield code="w">(DE-604)BV047076477</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of Computing</subfield><subfield code="v">13</subfield><subfield code="w">(DE-604)BV044943050</subfield><subfield code="9">13</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.14279/depositonce-10551</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=2&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">vlb</subfield><subfield code="d">20201216</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#vlb</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032483449</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047076508 |
| illustrated | Illustrated |
| indexdate | 2024-12-24T08:35:50Z |
| institution | BVB |
| institution_GND | (DE-588)5053182-7 |
| isbn | 9783798331730 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032483449 |
| oclc_num | 1230235741 |
| open_access_boolean | 1 |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 1 Online-Ressource (xii, 206 Seiten) Illustrationen, Diagramme |
| psigel | ebook |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Universitätsverlag der TU Berlin |
| record_format | marc |
| series | Foundations of Computing |
| series2 | Foundations of Computing |
| spelling | Molter, Hendrik Verfasser (DE-588)1224422430 aut Classic graph problems made temporal – a parameterized complexity analysis Hendrik Molter 202011 Berlin Universitätsverlag der TU Berlin 2020 1 Online-Ressource (xii, 206 Seiten) Illustrationen, Diagramme txt rdacontent c rdamedia cr rdacarrier Foundations of Computing 13 Dissertation Technische Universität Berlin 2019 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf temporal graphs temporal paths temporal matchings temporal coloring temporal cliques temporal cluster editing parameterized algorithms temporale Graphen temporale Pfade temporale Matchings temporale Knotenfärbung temporale Cliquen temporales Cluster editieren parametrisierte Algorithmen (DE-588)4113937-9 Hochschulschrift gnd-content Parametrisierte Komplexität (DE-588)4818897-9 s Graphentheorie (DE-588)4113782-6 s DE-604 Technische Universität Berlin Universitätsbibliothek (DE-588)5053182-7 pbl Erscheint auch als Druck-Ausgabe 978-3-7983-3172-3 (DE-604)BV047076477 Foundations of Computing 13 (DE-604)BV044943050 13 https://doi.org/10.14279/depositonce-10551 Resolving-System kostenfrei Volltext X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=1&dok_ext=htm Inhaltstext X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=2&dok_ext=htm Inhaltstext 1\p vlb 20201216 DE-101 https://d-nb.info/provenance/plan#vlb |
| spellingShingle | Molter, Hendrik Classic graph problems made temporal – a parameterized complexity analysis Foundations of Computing Graphentheorie (DE-588)4113782-6 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4818897-9 (DE-588)4113937-9 |
| title | Classic graph problems made temporal – a parameterized complexity analysis |
| title_auth | Classic graph problems made temporal – a parameterized complexity analysis |
| title_exact_search | Classic graph problems made temporal – a parameterized complexity analysis |
| title_full | Classic graph problems made temporal – a parameterized complexity analysis Hendrik Molter |
| title_fullStr | Classic graph problems made temporal – a parameterized complexity analysis Hendrik Molter |
| title_full_unstemmed | Classic graph problems made temporal – a parameterized complexity analysis Hendrik Molter |
| title_short | Classic graph problems made temporal – a parameterized complexity analysis |
| title_sort | classic graph problems made temporal a parameterized complexity analysis |
| topic | Graphentheorie (DE-588)4113782-6 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd |
| topic_facet | Graphentheorie Parametrisierte Komplexität Hochschulschrift |
| url | https://doi.org/10.14279/depositonce-10551 http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=1&dok_ext=htm http://deposit.dnb.de/cgi-bin/dokserv?id=31ebe2a9c4834a609d11e8abb093f363&prov=M&dok_var=2&dok_ext=htm |
| volume_link | (DE-604)BV044943050 |
| work_keys_str_mv | AT molterhendrik classicgraphproblemsmadetemporalaparameterizedcomplexityanalysis AT technischeuniversitatberlinuniversitatsbibliothek classicgraphproblemsmadetemporalaparameterizedcomplexityanalysis |