Satisfiability characterizations of upward planarity problems

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Zeranski, Robert (VerfasserIn)
Format: Abschlussarbeit Buch
Sprache:English
Veröffentlicht: München Verl. Dr. Hut 2014
Ausgabe:1. Aufl.
Schriftenreihe:Informatik
Schlagworte:
Online-Zugang:Inhaltstext
Inhaltsverzeichnis
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a22000008c 4500
001 BV041896866
003 DE-604
005 00000000000000.0
007 t|
008 140605s2014 gw d||| m||| 00||| eng d
015 |a 14,N20  |2 dnb 
016 7 |a 1050732286  |2 DE-101 
020 |a 9783843915557  |c Pb. : EUR 84.00 (DE), EUR 86.40 (AT), sfr 109.00 (freier Pr.)  |9 978-3-8439-1555-7 
020 |a 3843915555  |9 3-8439-1555-5 
024 3 |a 9783843915557 
035 |a (OCoLC)879879060 
035 |a (DE-599)DNB1050732286 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
044 |a gw  |c XA-DE-BY 
049 |a DE-91  |a DE-12 
082 0 |a 511.352  |2 22/ger 
084 |a 004  |2 sdnb 
100 1 |a Zeranski, Robert  |e Verfasser  |4 aut 
245 1 0 |a Satisfiability characterizations of upward planarity problems  |c Robert Zeranski 
250 |a 1. Aufl. 
263 |a 201405 
264 1 |a München  |b Verl. Dr. Hut  |c 2014 
300 |a XII, 196 S.  |b graph. Darst.  |c 210 mm x 148 mm, 283 g 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
490 0 |a Informatik 
502 |a Zugl.: Jena, Univ., Diss., 2014 
650 0 7 |a Erfüllbarkeitsproblem  |0 (DE-588)4323820-8  |2 gnd  |9 rswk-swf 
650 0 7 |a Gerichteter Graph  |0 (DE-588)4156815-1  |2 gnd  |9 rswk-swf 
650 0 7 |a Graphenzeichnen  |0 (DE-588)4706480-8  |2 gnd  |9 rswk-swf 
655 7 |0 (DE-588)4113937-9  |a Hochschulschrift  |2 gnd-content 
689 0 0 |a Gerichteter Graph  |0 (DE-588)4156815-1  |D s 
689 0 1 |a Graphenzeichnen  |0 (DE-588)4706480-8  |D s 
689 0 2 |a Erfüllbarkeitsproblem  |0 (DE-588)4323820-8  |D s 
689 0 |5 DE-604 
856 4 2 |m X:MVB  |q text/html  |u http://deposit.dnb.de/cgi-bin/dokserv?id=4658328&prov=M&dok_var=1&dok_ext=htm  |3 Inhaltstext 
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=027340677&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA  |3 Inhaltsverzeichnis 
943 1 |a oai:aleph.bib-bvb.de:BVB01-027340677 

Datensatz im Suchindex

DE-BY-TUM_call_number 0001 2014 A 3022
DE-BY-TUM_katkey 2004255
DE-BY-TUM_location Mag
DE-BY-TUM_media_number 040007902218
_version_ 1820876653560070144
adam_text CONTENTS ABSTRACT I ZUSAMMENFASSUNG III ACKNOWLEDGEMENTS V NOTATION VII I INTRODUCTION 1 1 INTRODUCTION 3 1.1 THE THEOREM OF COOK 5 1.2 CONTRIBUTION AND OVERVIEW 6 2 PRELIMINARIES 9 2.1 COMPUTATIONAL COMPLEXITY 9 2.2 GRAPH THEORY 11 2.2.1 (DIRECTED) GRAPHS 11 2.2.2 DRAWINGS AND EMBEDDINGS 16 2.2.3 SPR-TREES 18 2.3 SATISFIABILITY 20 2.3.1 PROPOSITIONAL LOGIC 22 2.3.2 BASIC CONCEPTS OF SAT-SOLVING 25 2.3.3 PSEUDO-BOOLEAN SATISFIABILITY 28 3 AN EXEMPLARY APPLICATION OF SAT 31 3.1 MONOTONE NORMAL FORM EQUIVALENCE TEST 31 3.2 THE ALGORITHMS OF FREDMAN AND KHACHIYAN 33 3.3 SAT BASED FK-ALGORITHMS 36 3.3.1 UNIT PROPAGATION 36 3.3.2 SPLITTING VARIABLES 37 3.3.3 SIMULATING FK-ALGORITHM A 38 3.4 EVALUATION AND CONCLUSION 40 IX HTTP://D-NB.INFO/1050732286 X CONTENTS II UPWARD DRAWINGS 45 4 UPWARD PLANARITY 47 4.1 UPWARD PLANAR DRAWINGS 47 4.1.1 BIMODALITY 48 4.1.2 OVERVIEW OF COMPLEXITY 50 4.2 QUASI-UPWARD PLANAR DRAWINGS 52 5 ALGORITHMS 55 5.1 FIXED EMBEDDINGS 55 5.1.1 ANGLE CHARACTERIZATION 55 5.1.2 UPWARD PLANARITY TESTING 59 5.1.3 BEND MINIMIZATION 63 5.2 EMBEDDING ENUMERATION (EE) 70 5.2.1 ENUMERATION METHOD 72 5.2.2 INCREMENTAL METHOD 72 5.2.3 SIMULTANEOUS METHOD 74 5.3 BRANCH-AND-BOUND (BB) 76 5.3.1 THE CORE ALGORITHM 77 5.3.2 MODIFICATIONS 78 5.3.3 BEND MINIMIZATION 82 5.4 PREPROCESSING 86 6 SAT FORMULATIONS 89 6.1 ORDERED EMBEDDING CHARACTERIZATION 89 6.1.1 ORDERED EMBEDDINGS 89 6.1.2 FORMULATION (OE) 90 6.1.3 VALIDITY 92 6.2 HANANI-TUTTE CHARACTERIZATION (FPSS) 99 6.3 HYBRID FORMULATIONS 100 6.4 ILP FORMULATIONS AND VARIANTS 101 7 OPTIMIZATION VARIANTS 103 7.1 UPWARD CROSSING MINIMIZATION 103 7.1.1 PBS FORMULATION 104 7.1.2 VALIDITY 106 7.1.3 ILP FORMULATION 115 7.2 MAXIMUM UPWARD PLANAR SUBGRAPH 115 7.2.1 PBS FORMULATION 117 7.2.2 VALIDITY 117 7.2.3 ILP FORMULATION AND VARIANTS 118 CONTENTS XI III EXPERIMENTS & CONCLUSION 123 8 UPWARD PLANARITY: A COMPUTATIONAL STUDY 125 8.1 IMPLEMENTATION ISSUES 125 8.2 EXPERIMENTAL SETTING 127 8.3 INSTANCES 128 8.3.1 INSTANCES FROM LITERATURE 128 8.3.2 CONSTRUCTED INSTANCES 128 8.4 CENTRAL FINDINGS 131 8.5 ROME AND NORTH 131 8.6 GENERAL EVALUATION ON IHPRAND 133 8.7 SERIES-PARALLEL GRAPHS 149 8.8 DETAILS ON SAT 149 9 OPTIMIZATION VARIANTS: EXPERIMENTS 157 9.1 EXPERIMENTAL SETTING 157 9.2 INSTANCES 158 9.3 UPWARD CROSSING MINIMIZATION 159 9.3.1 COMPARISON OF EXACT APPROACHES 159 9.3.2 UPWARD PLANAR INSTANCES 160 9.3.3 EXPERIMENTS ON PBS AND HEURISTICS 162 9.4 MAXIMUM UPWARD PLANAR SUBGRAPH 170 10 CONCLUSION AND OUTLOOK 173 BIBLIOGRAPHY 177 LIST OF FIGURES 187 LIST OF TABLES 189 CURRICULUM VITAE 191 INDEX 193
any_adam_object 1
author Zeranski, Robert
author_facet Zeranski, Robert
author_role aut
author_sort Zeranski, Robert
author_variant r z rz
building Verbundindex
bvnumber BV041896866
ctrlnum (OCoLC)879879060
(DE-599)DNB1050732286
dewey-full 511.352
dewey-hundreds 500 - Natural sciences and mathematics
dewey-ones 511 - General principles of mathematics
dewey-raw 511.352
dewey-search 511.352
dewey-sort 3511.352
dewey-tens 510 - Mathematics
discipline Informatik
Mathematik
edition 1. Aufl.
format Thesis
Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02016nam a22005058c 4500</leader><controlfield tag="001">BV041896866</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">140605s2014 gw d||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">14,N20</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1050732286</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783843915557</subfield><subfield code="c">Pb. : EUR 84.00 (DE), EUR 86.40 (AT), sfr 109.00 (freier Pr.)</subfield><subfield code="9">978-3-8439-1555-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3843915555</subfield><subfield code="9">3-8439-1555-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783843915557</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)879879060</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1050732286</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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-91</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zeranski, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Satisfiability characterizations of upward planarity problems</subfield><subfield code="c">Robert Zeranski</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="263" ind1=" " ind2=" "><subfield code="a">201405</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Verl. Dr. Hut</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 196 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">210 mm x 148 mm, 283 g</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">Informatik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Jena, Univ., Diss., 2014</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="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">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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=4658328&amp;prov=M&amp;dok_var=1&amp;dok_ext=htm</subfield><subfield code="3">Inhaltstext</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&amp;doc_library=BVB01&amp;local_base=BVB01&amp;doc_number=027340677&amp;sequence=000001&amp;line_number=0001&amp;func_code=DB_RECORDS&amp;service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027340677</subfield></datafield></record></collection>
genre (DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet Hochschulschrift
id DE-604.BV041896866
illustrated Illustrated
indexdate 2024-12-24T04:08:21Z
institution BVB
isbn 9783843915557
3843915555
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-027340677
oclc_num 879879060
open_access_boolean
owner DE-91
DE-BY-TUM
DE-12
owner_facet DE-91
DE-BY-TUM
DE-12
physical XII, 196 S. graph. Darst. 210 mm x 148 mm, 283 g
publishDate 2014
publishDateSearch 2014
publishDateSort 2014
publisher Verl. Dr. Hut
record_format marc
series2 Informatik
spellingShingle Zeranski, Robert
Satisfiability characterizations of upward planarity problems
Erfüllbarkeitsproblem (DE-588)4323820-8 gnd
Gerichteter Graph (DE-588)4156815-1 gnd
Graphenzeichnen (DE-588)4706480-8 gnd
subject_GND (DE-588)4323820-8
(DE-588)4156815-1
(DE-588)4706480-8
(DE-588)4113937-9
title Satisfiability characterizations of upward planarity problems
title_auth Satisfiability characterizations of upward planarity problems
title_exact_search Satisfiability characterizations of upward planarity problems
title_full Satisfiability characterizations of upward planarity problems Robert Zeranski
title_fullStr Satisfiability characterizations of upward planarity problems Robert Zeranski
title_full_unstemmed Satisfiability characterizations of upward planarity problems Robert Zeranski
title_short Satisfiability characterizations of upward planarity problems
title_sort satisfiability characterizations of upward planarity problems
topic Erfüllbarkeitsproblem (DE-588)4323820-8 gnd
Gerichteter Graph (DE-588)4156815-1 gnd
Graphenzeichnen (DE-588)4706480-8 gnd
topic_facet Erfüllbarkeitsproblem
Gerichteter Graph
Graphenzeichnen
Hochschulschrift
url http://deposit.dnb.de/cgi-bin/dokserv?id=4658328&prov=M&dok_var=1&dok_ext=htm
http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027340677&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv AT zeranskirobert satisfiabilitycharacterizationsofupwardplanarityproblems