Be sparse! Be dense! Be robust!: elements of parameterized algorithmics
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Universitätsverlag der TU Berlin
2017
|
| Schriftenreihe: | Foundations of computing
8 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis Volltext Inhaltsverzeichnis |
| Beschreibung: | xvi, 251 Seiten Illustrationen, Diagramme 21 cm |
| ISBN: | 9783798328853 3798328854 |
| DOI: | 10.14279/depositonce-5635 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV044945165 | ||
| 003 | DE-604 | ||
| 005 | 20180717 | ||
| 007 | t | ||
| 008 | 180515s2017 gw a||| m||| 00||| eng d | ||
| 015 | |a 17,N28 |2 dnb | ||
| 015 | |a 17,A42 |2 dnb | ||
| 015 | |a 17,H11 |2 dnb | ||
| 016 | 7 | |a 1136332030 |2 DE-101 | |
| 020 | |a 9783798328853 |c Broschur : EUR 13.00 (DE), EUR 13.40 (AT) |9 978-3-7983-2885-3 | ||
| 020 | |a 3798328854 |9 3-7983-2885-4 | ||
| 024 | 3 | |a 9783798328853 | |
| 035 | |a (OCoLC)1036313351 | ||
| 035 | |a (DE-599)DNB1136332030 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-83 | ||
| 082 | 0 | |a 004.01511352 |2 22/ger | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Sorge, Manuel |e Verfasser |0 (DE-588)1159604347 |4 aut | |
| 245 | 1 | 0 | |a Be sparse! Be dense! Be robust! |b elements of parameterized algorithmics |c Manuel Sorge |
| 264 | 1 | |a Berlin |b Universitätsverlag der TU Berlin |c 2017 | |
| 300 | |a xvi, 251 Seiten |b Illustrationen, Diagramme |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations of computing |v 8 | |
| 502 | |b Dissertation |c Technische Universität Berlin |d 2016 | ||
| 650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |g Graphentheorie |0 (DE-588)4705155-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hypergraph |0 (DE-588)4161063-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Teilgraph |0 (DE-588)4280772-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 653 | |a Graphverbundenheit | ||
| 653 | |a Netzwerkdesign | ||
| 653 | |a berechnungsschwere Probleme | ||
| 653 | |a graph connectivity | ||
| 653 | |a hard computational problems | ||
| 653 | |a hypergraph supports | ||
| 653 | |a network design | ||
| 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 Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 3 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 0 | 4 | |a Hypergraph |0 (DE-588)4161063-5 |D s |
| 689 | 0 | 5 | |a Teilgraph |0 (DE-588)4280772-4 |D s |
| 689 | 0 | 6 | |a Netzwerk |g Graphentheorie |0 (DE-588)4705155-3 |D s |
| 689 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 0 | 8 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |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 Online-Ausgabe |o 10.14279/depositonce-5635 |z 978-3-7983-2886-0 |w (DE-604)BV044945176 |
| 830 | 0 | |a Foundations of computing |v 8 |w (DE-604)BV042337479 |9 8 | |
| 856 | 4 | 2 | |m B:DE-101 |q application/pdf |u http://d-nb.info/1136332030/04 |3 Inhaltsverzeichnis |
| 856 | 4 | 1 | |u https://doi.org/10.14279/depositonce-5635 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030338011&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030338011 | ||
Datensatz im Suchindex
| _version_ | 1804178532121706496 |
|---|---|
| adam_text | CONTENTS
1 INTRODUCTION 1
1.1
PRELIMINARIES........................................................................................
5
1 BE SPARSE! 19
2 INTRODUCTION TO HYPERGRAPH SUPPORTS 21
2.1 PARAMETERIZATION BY THE NUMBER OF HYPEREDGES
....................................26
3 MINIMUM-EDGE HYPERGRAPH SUPPORTS 31
3.1
INTRODUCTION...........................................................................................32
3.2 SPECIFIC PRELIMINARIES
.............................................................................
37
3.3 BEWARE OF REMOVING TW I N S
.....................................................................
37
3.4 DATA REDUCTION RULES FOR INSTANCES WITH FEW HYPEREDGES
........................
43
3.5 A FAMILY OF HYPERGRAPHS REQUIRING SUPPORTS WITH LARGE FEEDBACK EDGE
N U M B E
R...................................................................................................49
3.6 DATA REDUCTION RULES FOR SPARSE SUPPORTS
................................................
50
3.7 CONCLUDING
REMARKS................................................................................
65
4 PLANAR HYPERGRAPH SUPPORTS 67
4.1
INTRODUCTION...........................................................................................68
4.2 SPECIFIC PRELIMINARIES
.............................................................................
72
4.3 BEWARE OF REMOVING TW I N S
.....................................................................
75
4.4 A SEQUENCE OF GLUABLE EDGE BIPARTITIONS
................................................
78
4.5 A PROBLEM KERNEL FOR R-OUTERPLANAR S U P P O RT
........................................
86
4.6 CONCLUDING
REMARKS................................................................................
91
II BE DENSE!
95
5 INTRODUCTION TO DENSE SUBGRAPH PROBLEMS 97
6 SUBGRAPHS OF FIXED MINIMUM DENSITY 105
6.1
INTRODUCTION.........................................................................................
106
6.2 A FIXED-PARAMETER ALGORITHM FOR CARDINALITY-CONSTRAINED OPTIMIZATION
111
6.3 APPLICATION TO FINDING
JU-CLIQUES............................................................
124
6.4 W [1] -HARDNESS FOR PARAMETERIZATION BY DEGENERACY AND SOLUTION SIZE
129
6.5 CONCLUDING REM
ARKS...............................................................................133
7 HIGHLY CONNECTED SUBGRAPHS 135
7.1
INTRODUCTION.........................................................................................
136
7.2 SPECIFIC
PRELIMINARIES............................................................................
140
7.3 HARDNESS RESU
LTS....................................................................................
141
7.4 A LGORITHM
S............................................................................................
150
7.5 CONCLUDING REM
ARKS...............................................................................168
III BE ROBUST! 171
8 VECTOR CONNECTIVITY SETS 173
8.1
INTRODUCTION.........................................................................................
174
8.2 SPECIFIC
PRELIMINARIES............................................................................
177
8.3 REDUCING THE NUMBER OF VERTICES WITH NONZERO DEMAND
....................
180
8.4 A FIXED-PARAMETER ALGORITHM FOR SMALL VECTOR CONNECTIVITY SETS . . .
.185
6.5 KERNELIZATION OUTLINE AND NON-CONSTRUCTIVE A RG U M E N
T.......................191
6.6 VERTEX-LINEAR KERNELIZATION FOR CONSTANT DEM AND
.................................
195
8.7 KERNELIZATION LOWER BO U N D
....................................................................215
8.8 CONCLUDING REMARKS
..............................................................................
217
9 OUTLOOK 219
BIBLIOGRAPHY 222
A PROBLEM COMPENDIUM 247
ACKNOWLEDGMENTS 251
|
| any_adam_object | 1 |
| author | Sorge, Manuel |
| author_GND | (DE-588)1159604347 |
| author_facet | Sorge, Manuel |
| author_role | aut |
| author_sort | Sorge, Manuel |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV044945165 |
| classification_rvk | ST 134 |
| collection | ebook |
| ctrlnum | (OCoLC)1036313351 (DE-599)DNB1136332030 |
| dewey-full | 004.01511352 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.01511352 |
| dewey-search | 004.01511352 |
| dewey-sort | 14.01511352 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.14279/depositonce-5635 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03514nam a2200805 cb4500</leader><controlfield tag="001">BV044945165</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180717 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">180515s2017 gw a||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">17,N28</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">17,A42</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">17,H11</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1136332030</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798328853</subfield><subfield code="c">Broschur : EUR 13.00 (DE), EUR 13.40 (AT)</subfield><subfield code="9">978-3-7983-2885-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3798328854</subfield><subfield code="9">3-7983-2885-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783798328853</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1036313351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1136332030</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="082" ind1="0" ind2=" "><subfield code="a">004.01511352</subfield><subfield code="2">22/ger</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="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sorge, Manuel</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1159604347</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Be sparse! Be dense! Be robust!</subfield><subfield code="b">elements of parameterized algorithmics</subfield><subfield code="c">Manuel Sorge</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">2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xvi, 251 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">21 cm</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="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">8</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2016</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4705155-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Teilgraph</subfield><subfield code="0">(DE-588)4280772-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</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="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graphverbundenheit</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Netzwerkdesign</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">berechnungsschwere Probleme</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph connectivity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hard computational problems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hypergraph supports</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network design</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Teilgraph</subfield><subfield code="0">(DE-588)4280772-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Netzwerk</subfield><subfield code="g">Graphentheorie</subfield><subfield code="0">(DE-588)4705155-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="8"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</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">Online-Ausgabe</subfield><subfield code="o">10.14279/depositonce-5635</subfield><subfield code="z">978-3-7983-2886-0</subfield><subfield code="w">(DE-604)BV044945176</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">8</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">8</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">B:DE-101</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://d-nb.info/1136332030/04</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.14279/depositonce-5635</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">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030338011&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030338011</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV044945165 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:05:28Z |
| institution | BVB |
| institution_GND | (DE-588)5053182-7 |
| isbn | 9783798328853 3798328854 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030338011 |
| oclc_num | 1036313351 |
| open_access_boolean | 1 |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | xvi, 251 Seiten Illustrationen, Diagramme 21 cm |
| psigel | ebook |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Universitätsverlag der TU Berlin |
| record_format | marc |
| series | Foundations of computing |
| series2 | Foundations of computing |
| spelling | Sorge, Manuel Verfasser (DE-588)1159604347 aut Be sparse! Be dense! Be robust! elements of parameterized algorithmics Manuel Sorge Berlin Universitätsverlag der TU Berlin 2017 xvi, 251 Seiten Illustrationen, Diagramme 21 cm txt rdacontent n rdamedia nc rdacarrier Foundations of computing 8 Dissertation Technische Universität Berlin 2016 Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Netzwerk Graphentheorie (DE-588)4705155-3 gnd rswk-swf Hypergraph (DE-588)4161063-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Teilgraph (DE-588)4280772-4 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Graphverbundenheit Netzwerkdesign berechnungsschwere Probleme graph connectivity hard computational problems hypergraph supports network design (DE-588)4113937-9 Hochschulschrift gnd-content Parametrisierte Komplexität (DE-588)4818897-9 s Informatik (DE-588)4026894-9 s Berechnungskomplexität (DE-588)4134751-1 s NP-vollständiges Problem (DE-588)4138229-8 s Hypergraph (DE-588)4161063-5 s Teilgraph (DE-588)4280772-4 s Netzwerk Graphentheorie (DE-588)4705155-3 s Graphenzeichnen (DE-588)4706480-8 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Technische Universität Berlin Universitätsbibliothek (DE-588)5053182-7 pbl Erscheint auch als Online-Ausgabe 10.14279/depositonce-5635 978-3-7983-2886-0 (DE-604)BV044945176 Foundations of computing 8 (DE-604)BV042337479 8 B:DE-101 application/pdf http://d-nb.info/1136332030/04 Inhaltsverzeichnis https://doi.org/10.14279/depositonce-5635 Resolving-System kostenfrei Volltext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030338011&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sorge, Manuel Be sparse! Be dense! Be robust! elements of parameterized algorithmics Foundations of computing Graphenzeichnen (DE-588)4706480-8 gnd Netzwerk Graphentheorie (DE-588)4705155-3 gnd Hypergraph (DE-588)4161063-5 gnd Informatik (DE-588)4026894-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Teilgraph (DE-588)4280772-4 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)4706480-8 (DE-588)4705155-3 (DE-588)4161063-5 (DE-588)4026894-9 (DE-588)4134751-1 (DE-588)4280772-4 (DE-588)4138229-8 (DE-588)4818897-9 (DE-588)4125422-3 (DE-588)4113937-9 |
| title | Be sparse! Be dense! Be robust! elements of parameterized algorithmics |
| title_auth | Be sparse! Be dense! Be robust! elements of parameterized algorithmics |
| title_exact_search | Be sparse! Be dense! Be robust! elements of parameterized algorithmics |
| title_full | Be sparse! Be dense! Be robust! elements of parameterized algorithmics Manuel Sorge |
| title_fullStr | Be sparse! Be dense! Be robust! elements of parameterized algorithmics Manuel Sorge |
| title_full_unstemmed | Be sparse! Be dense! Be robust! elements of parameterized algorithmics Manuel Sorge |
| title_short | Be sparse! Be dense! Be robust! |
| title_sort | be sparse be dense be robust elements of parameterized algorithmics |
| title_sub | elements of parameterized algorithmics |
| topic | Graphenzeichnen (DE-588)4706480-8 gnd Netzwerk Graphentheorie (DE-588)4705155-3 gnd Hypergraph (DE-588)4161063-5 gnd Informatik (DE-588)4026894-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Teilgraph (DE-588)4280772-4 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Parametrisierte Komplexität (DE-588)4818897-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Graphenzeichnen Netzwerk Graphentheorie Hypergraph Informatik Berechnungskomplexität Teilgraph NP-vollständiges Problem Parametrisierte Komplexität Effizienter Algorithmus Hochschulschrift |
| url | http://d-nb.info/1136332030/04 https://doi.org/10.14279/depositonce-5635 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030338011&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT sorgemanuel besparsebedenseberobustelementsofparameterizedalgorithmics AT technischeuniversitatberlinuniversitatsbibliothek besparsebedenseberobustelementsofparameterizedalgorithmics |
Es ist kein Print-Exemplar vorhanden.
Volltext öffnen