Degree constrained editing of small degree graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Univ.-Verl. der TU Berlin
2015
|
| Schriftenreihe: | Foundations of computing
2 |
| Schlagworte: | |
| Online-Zugang: | kostenfrei Inhaltsverzeichnis |
| Beschreibung: | xiv, 225 S. graph. Darst. |
| ISBN: | 9783798327610 9783798327627 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV042755484 | ||
| 003 | DE-604 | ||
| 005 | 20151202 | ||
| 007 | t | ||
| 008 | 150812s2015 d||| m||| 00||| eng d | ||
| 020 | |a 9783798327610 |c Print |9 978-3-7983-2761-0 | ||
| 020 | |a 9783798327627 |c Online |9 978-3-7983-2762-7 | ||
| 035 | |a (OCoLC)924149544 | ||
| 035 | |a (DE-599)BVBBV042755484 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-91 |a DE-384 | ||
| 082 | 0 | |a 510 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Nichterlein, André |e Verfasser |0 (DE-588)1075288770 |4 aut | |
| 245 | 1 | 0 | |a Degree constrained editing of small degree graphs |c André Nichterlein |
| 246 | 1 | |a Degree-constrained editing of small-degree graphs | |
| 264 | 1 | |a Berlin |b Univ.-Verl. der TU Berlin |c 2015 | |
| 300 | |a xiv, 225 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations of computing |v 2 | |
| 502 | |a Zugl.: Berlin, Techn. Univ., Diss., 2014 | ||
| 650 | 0 | 7 | |a Azyklischer gerichteter Graph |0 (DE-588)4143834-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Azyklischer gerichteter Graph |0 (DE-588)4143834-6 |D s |
| 689 | 0 | 1 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:kobv:83-opus4-65205 |
| 830 | 0 | |a Foundations of computing |v 2 |w (DE-604)BV042337479 |9 2 | |
| 856 | 4 | 1 | |u https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-65205 |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=028186145&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-028186145 | ||
Datensatz im Suchindex
| _version_ | 1804174972437921792 |
|---|---|
| adam_text | CONTENTS
1. INTRODUCTION AND OVERVIEW 1
1.1. DAG REALIZATION 4
1.2. DEGREE ANONYMITY 5
2. PRELIMINARIES AND NOTATION 13
2.1. GRAPHS 13
2.2. COMPUTATIONAL COMPLEXITY 20
2.3. PARAMETERIZED COMPLEXITY 21
2.4. APPROXIMATION 24
3. BASICS ON DEGREE FACTORS 29
3.1. REALIZABLE DEGREE SEQUENCES 30
3.1.1. REALIZING UNDIRECTED GRAPHS 31
3.1.2. REALIZING DIRECTED GRAPHS 35
3.2. /-FACTORS AND MORE GENERAL DEGREE FACTORS 40
3.2.1. /-FACTORS 40
3.2.2. GENERALIZATIONS OF /-FACTORS 41
4. DAG REALIZATION 47
4.1. INTRODUCTION 47
4.2. NP-COMPLETENESS 50
4.3. FIXED-PARAMETER TRACTABILITY WITH RESPECT TO MAXIMUM DEGREE 58
4.3.1. GENERAL TERMS AND OBSERVATIONS 60
4.3.2. HIGH-POTENTIAL SEQUENCES 68
4.3.3. LOW-POTENTIAL SEQUENCES 77
4.4. FIXED-PARAMETER TRACTABILITY WITH RESPECT TO (2) * TO AND TO *71
+1 83
4.5. CONCLUSION 89
5. DEGREE ANONYMITY BY VERTEX AND EDGE DELETION 91
5.1. INTRODUCTION 91
XIII
HTTP://D-NB.INFO/1073542696
5.2. VERTEX DELETION 98
5.2.1. NP-HARDNESS ON TREES 99
5.2.2. GENERIC REDUCTION 102
5.2.3. INAPPROXIMABILITY RESULTS 108
5.2.4. POLYNOMIALLY-TIME SOLVABLE CASES 112
5.3. EDGE DELETION 116
5.3.1. NP-HARDNESS ON CATERPILLARS 116
5.3.2. INAPPROXIMABILITY RESULTS 119
5.4. FIXED-PARAMETER TRACTABLE CASES 125
5.5. CONCLUSION 130
6. DEGREE ANONYMITY BY EDGE INSERTION 131
6.1. INTRODUCTION 131
6.2. COMPUTATIONAL HARDNESS 134
6.3. POLYNOMIAL KERNEL FOR THE PARAMETER MAXIMUM DEGREE 138
6.3.1. THE /-FACTOR PROBLEM 139
6.3.2. A POLYNOMIAL-TIME ALGORITHM FOR LARGE -SOLUTION INSTANCESL41
6.3.3. POLYNOMIAL KERNEL 148
6.4. FIXED-PARAMETER ALGORITHM FOR THE PARAMETER MAXIMUM DEGREE 155
6.5. A GENERAL APPROACH FOR DEGREE SEQUENCE COMPLETION PROBLEMS . 157
6.5.1. FIXED-PARAMETER TRACTABILITY OF EI-DSC 157
6.5.2. APPLICATIONS OF DEGREE SEQUENCE COMPLETION PROBLEMS . . 161
6.6. UPPER AND LOWER BOUNDS FOR DEGREE ANONYMITY BY EDGE INSERTION 162
6.6.1. GENERAL FRAMEWORK DESCRIPTION 163
6.6.2. PHASE 1: EXACT FC-ANONYMIZATION OF DEGREE SEQUENCES . . 167
6.6.3. PHASE 2: REALIZING A FC-ANONYMOUS DEGREE SEQUENCE . . . 178
6.6.4. FURTHER UPPER-BOUND HEURISTICS 183
6.6.5. EXPERIMENTAL EVALUATION 186
6.7. CONCLUSION 198
7. CONCLUSION AND OUTLOOK 199
BIBLIOGRAPHY 203
A. COMPLETE LIST OF EXPERIMENTAL RESULTS 215
XIV
|
| any_adam_object | 1 |
| author | Nichterlein, André |
| author_GND | (DE-588)1075288770 |
| author_facet | Nichterlein, André |
| author_role | aut |
| author_sort | Nichterlein, André |
| author_variant | a n an |
| building | Verbundindex |
| bvnumber | BV042755484 |
| classification_rvk | SK 890 |
| collection | ebook |
| ctrlnum | (OCoLC)924149544 (DE-599)BVBBV042755484 |
| dewey-full | 510 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510 |
| dewey-search | 510 |
| dewey-sort | 3510 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01982nam a2200457 cb4500</leader><controlfield tag="001">BV042755484</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20151202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150812s2015 d||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798327610</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-7983-2761-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798327627</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-7983-2762-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)924149544</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042755484</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nichterlein, André</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1075288770</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Degree constrained editing of small degree graphs</subfield><subfield code="c">André Nichterlein</subfield></datafield><datafield tag="246" ind1="1" ind2=" "><subfield code="a">Degree-constrained editing of small-degree graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Univ.-Verl. der TU Berlin</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 225 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="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">2</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Berlin, Techn. Univ., Diss., 2014</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Azyklischer gerichteter Graph</subfield><subfield code="0">(DE-588)4143834-6</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="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">Azyklischer gerichteter Graph</subfield><subfield code="0">(DE-588)4143834-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</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">urn:nbn:de:kobv:83-opus4-65205</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV042337479</subfield><subfield code="9">2</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-65205</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=028186145&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-028186145</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042755484 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:08:53Z |
| institution | BVB |
| isbn | 9783798327610 9783798327627 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028186145 |
| oclc_num | 924149544 |
| open_access_boolean | 1 |
| owner | DE-83 DE-91 DE-BY-TUM DE-384 |
| owner_facet | DE-83 DE-91 DE-BY-TUM DE-384 |
| physical | xiv, 225 S. graph. Darst. |
| psigel | ebook |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Univ.-Verl. der TU Berlin |
| record_format | marc |
| series | Foundations of computing |
| series2 | Foundations of computing |
| spelling | Nichterlein, André Verfasser (DE-588)1075288770 aut Degree constrained editing of small degree graphs André Nichterlein Degree-constrained editing of small-degree graphs Berlin Univ.-Verl. der TU Berlin 2015 xiv, 225 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Foundations of computing 2 Zugl.: Berlin, Techn. Univ., Diss., 2014 Azyklischer gerichteter Graph (DE-588)4143834-6 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Azyklischer gerichteter Graph (DE-588)4143834-6 s NP-vollständiges Problem (DE-588)4138229-8 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:kobv:83-opus4-65205 Foundations of computing 2 (DE-604)BV042337479 2 https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-65205 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=028186145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Nichterlein, André Degree constrained editing of small degree graphs Foundations of computing Azyklischer gerichteter Graph (DE-588)4143834-6 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd |
| subject_GND | (DE-588)4143834-6 (DE-588)4138229-8 (DE-588)4113937-9 |
| title | Degree constrained editing of small degree graphs |
| title_alt | Degree-constrained editing of small-degree graphs |
| title_auth | Degree constrained editing of small degree graphs |
| title_exact_search | Degree constrained editing of small degree graphs |
| title_full | Degree constrained editing of small degree graphs André Nichterlein |
| title_fullStr | Degree constrained editing of small degree graphs André Nichterlein |
| title_full_unstemmed | Degree constrained editing of small degree graphs André Nichterlein |
| title_short | Degree constrained editing of small degree graphs |
| title_sort | degree constrained editing of small degree graphs |
| topic | Azyklischer gerichteter Graph (DE-588)4143834-6 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd |
| topic_facet | Azyklischer gerichteter Graph NP-vollständiges Problem Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-65205 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028186145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042337479 |
| work_keys_str_mv | AT nichterleinandre degreeconstrainededitingofsmalldegreegraphs |