Algorithms for the feedback arc set problem:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
Passau
Univ.
2010
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 153 S. Ill., graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036589978 | ||
| 003 | DE-604 | ||
| 005 | 20100811 | ||
| 007 | t | ||
| 008 | 100728s2010 ad|| m||| 00||| ger d | ||
| 035 | |a (OCoLC)705702529 | ||
| 035 | |a (DE-599)BVBBV036589978 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-739 | ||
| 100 | 1 | |a Hanauer, Kathrin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for the feedback arc set problem |c Kathrin Hanauer |
| 264 | 1 | |a Passau |b Univ. |c 2010 | |
| 300 | |a 153 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Passau, Univ., Masterarbeit, 2010 | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020510707&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020510707 | ||
Datensatz im Suchindex
| _version_ | 1804143189010939905 |
|---|---|
| adam_text | Contents
1.
Introduction
5
2.
The Feedback Arc Set Problem
12
2.1.
Definition
.................................... 12
2.1.1.
Feedback Arc Set and Equivalent Problems
............. 12
2.1.2.
Linear Programming
.......................... 17
2.2.
Complexity and Approximability
....................... 22
2.2.1.
Checking Acyclicity
.......................... 22
2.2.2.
Common Graphs
............................ 23
2.2.3.
Tournaments
.............................. 29
2.2.4.
Planar Graphs
............................. 33
2.2.5.
Other classes
.............................. 34
2.3.
Related Research
................................ 36
2.3.1.
Maximum Cardinality of Minimum Feedback Arc Sets
....... 36
2.3.2.
Weighted Feedback Arc Set
...................... 37
2.3.3.
Feedback Vertex Set
.......................... 38
2.3.4.
Disjoint Cycles
............................. 40
2.3.5.
Penalty Graphs
............................. 40
3.
Heuristic Algorithms
42
3.1.
Simplifications and Preprocessing
....................... 43
3.1.1.
Loop Elimination
............................ 43
3.1.2.
Two-Cycle Elimination
........................ 43
3.1.3.
Multiple Edges
............................. 44
3.1.4.
Connectedness
............................. 48
3.2.
Arrangement Algorithms
............................ 48
3.2.1.
Eades-Lin-Smyth Algorithm
...................... 48
3.2.2.
KwikSort Algorithm
.......................... 56
3.2.3.
Sifting Algorithm
............................ 62
3.2.4.
Kobylánski-Chanas
Algorithm
.................... 66
3.2.5.
Two Segment Optimality
....................... 69
3.3.
Arc Set Algorithms
............................... 70
3.3.1.
Berger-Shor Algorithm
......................... 71
3.3.2.
Demetrescu-Finocchi Algorithm
.................... 74
3.3.3.
Saab s Algorithm
............................ 81
3.4.
Algorithm Properties
.............................. 88
3.4.1.
Criteria
................................. 88
3.4.2.
Evaluation
............................... 90
4.
The Algorithm Test Suite
98
4.1.
Basic Decisions
................................. 98
4.1.1.
Programming Language
........................ 98
4.1.2.
Graph Representation
......................... 99
4.2.
Class Design
.................................. 99
4.3.
Test Graph Generation
............................. 101
4.3.1.
Graph Generators
........................... 101
4.3.2.
Property Builders
........................... 107
4.3.3.
Graph Filters
.............................. 109
4.4.
Algorithm Implementations
..........................
Ill
4.5.
Error Checking
.................................
Ill
5.
Experimental Study
112
5.1.
Degree Distributions
..............................112
5.2.
Performance
...................................116
5.2.1.
Pure Algorithm Performances
.....................116
5.2.2.
Algorithm Performance with Postprocessing
.............127
5.3.
Execution Times
................................130
6.
Conclusion
137
A, Linear Program Listings
152
|
| any_adam_object | 1 |
| author | Hanauer, Kathrin |
| author_facet | Hanauer, Kathrin |
| author_role | aut |
| author_sort | Hanauer, Kathrin |
| author_variant | k h kh |
| building | Verbundindex |
| bvnumber | BV036589978 |
| ctrlnum | (OCoLC)705702529 (DE-599)BVBBV036589978 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01032nam a2200277 c 4500</leader><controlfield tag="001">BV036589978</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100811 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100728s2010 ad|| m||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)705702529</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036589978</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hanauer, Kathrin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for the feedback arc set problem</subfield><subfield code="c">Kathrin Hanauer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="b">Univ.</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">153 S.</subfield><subfield code="b">Ill., 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="502" ind1=" " ind2=" "><subfield code="a">Passau, Univ., Masterarbeit, 2010</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="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</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=020510707&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020510707</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV036589978 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:43:35Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020510707 |
| oclc_num | 705702529 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | 153 S. Ill., graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Univ. |
| record_format | marc |
| spelling | Hanauer, Kathrin Verfasser aut Algorithms for the feedback arc set problem Kathrin Hanauer Passau Univ. 2010 153 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Passau, Univ., Masterarbeit, 2010 (DE-588)4113937-9 Hochschulschrift gnd-content Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020510707&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hanauer, Kathrin Algorithms for the feedback arc set problem |
| subject_GND | (DE-588)4113937-9 |
| title | Algorithms for the feedback arc set problem |
| title_auth | Algorithms for the feedback arc set problem |
| title_exact_search | Algorithms for the feedback arc set problem |
| title_full | Algorithms for the feedback arc set problem Kathrin Hanauer |
| title_fullStr | Algorithms for the feedback arc set problem Kathrin Hanauer |
| title_full_unstemmed | Algorithms for the feedback arc set problem Kathrin Hanauer |
| title_short | Algorithms for the feedback arc set problem |
| title_sort | algorithms for the feedback arc set problem |
| topic_facet | Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020510707&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hanauerkathrin algorithmsforthefeedbackarcsetproblem |