Paths, flows and VLSI-layout: [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop]
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer-Verlag
1990
|
| Schriftenreihe: | Algorithms and Combinatorics
9 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XXII, 383 Seiten graph. Darst. |
| ISBN: | 3540526854 0387526854 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004257105 | ||
| 003 | DE-604 | ||
| 005 | 20210222 | ||
| 007 | t | ||
| 008 | 910314s1990 d||| |||| 10||| engod | ||
| 020 | |a 3540526854 |9 3-540-52685-4 | ||
| 020 | |a 0387526854 |9 0-387-52685-4 | ||
| 035 | |a (OCoLC)644309335 | ||
| 035 | |a (DE-599)BVBBV004257105 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-19 |a DE-384 |a DE-91G |a DE-91 |a DE-739 |a DE-29T |a DE-20 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a ST 190 |0 (DE-625)143607: |2 rvk | ||
| 084 | |a SD 1988 |0 (DE-625)142722: |2 rvk | ||
| 084 | |a SS 1988 |0 (DE-625)143425: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a 90-06 |2 msc | ||
| 084 | |a ELT 555f |2 stub | ||
| 084 | |a 05-06 |2 msc | ||
| 084 | |a MAT 052f |2 stub | ||
| 084 | |a 68-06 |2 msc | ||
| 245 | 1 | 0 | |a Paths, flows and VLSI-layout |b [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] |c Bernhard Korte [und 3 andere], editors |
| 264 | 1 | |a Berlin [u.a.] |b Springer-Verlag |c 1990 | |
| 300 | |a XXII, 383 Seiten |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and Combinatorics |v 9 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Layout |g Mikroelektronik |0 (DE-588)4264372-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a VLSI |0 (DE-588)4117388-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1988 |z Bonn |2 gnd-content | |
| 689 | 0 | 0 | |a VLSI |0 (DE-588)4117388-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a VLSI |0 (DE-588)4117388-0 |D s |
| 689 | 1 | 1 | |a Layout |g Mikroelektronik |0 (DE-588)4264372-7 |D s |
| 689 | 1 | 2 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Korte, Bernhard |d 1938- |0 (DE-588)139321802 |4 edt | |
| 830 | 0 | |a Algorithms and Combinatorics |v 9 |w (DE-604)BV000617357 |9 9 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002648204&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
| _version_ | 1805081793889566720 |
|---|---|
| adam_text |
Table of Contents
On Some Applications of the Chinese Postman Problem 1
Francisco Barahona
1. Introduction 1
2. Spin Glasses 2
3. Via Minimization 6
4. Planar Multicommodity Flows 8
5. Max Cut in Graphs Not Contractible to K5 10
6. Using Polynomial Size Linear Programming 13
References 15
Separator Theorems and Their Applications 17
Fan R. K. Chung
1. Introduction 17
2. Separator Theorems for Trees 17
3. Separators for Colored Trees 22
4. Separator Theorems for Planar Graphs 24
5. Separator Theorems and Universal Graphs 26
6. Concluding Remarks 32
References 33
Some of My Old and New Combinatorial Problems 35
Paul Erdos
References 43
Packing Paths, Circuits and Cuts A Survey 47
Andras Frank
1. Introduction 47
2. Disjoint Paths Problem 50
3. G + H is Eulerian 54
4. Further Necessary Conditions 64
5. Problems on Grids 72
6. When the Disjoint Paths Problem is Tractable 77
7. Maximization 80
VIII Table of Contents
8. T joins and T cuts 85
9. Packing Cuts and Circuits 92
References 97
Network Flow Algorithms 101
Andrew V. Goldberg, Eva Tardos and Robert E. Tarjan
0. Introduction 101
1. Preliminaries 105
2. The Maximum Flow Problem 114
3. The Minimum Cost Circulation Problem: Cost Scaling 127
4. Strongly Polynomial Algorithms Based on Cost Scaling 137
5. Capacity Scaling Algorithms 145
6. The Generalized Flow Problem 151
References 160
Routing Problems in Grid Graphs 165
Michael Kaufmann and Kurt Mehlhorn
1. Introduction 165
2. Edge Disjoint Paths in Planar Graphs 166
3. Homotopic Edge Disjoint Path Problems 168
4. The Evenness Assumption 173
5. Routing Regions Without Holes 175
6. Routing Regions with Exactly One Inner Hole 177
7. Layer Assignment. 179
8. Multiterminal Nets 181
References 182
Steiner Trees in VLSI Layout 185
Bernhard Korte, Hans Jiirgen Promel and Angelika Steger
1. Introduction 185
j 2. The Steiner Problem in Graphs 188
I 3. A Routing Algorithm for VLSI Chips 201
f References 212
Cycles Through Prescribed Elements in a Graph 215
Michael V. Lomonosov
1. Introduction 215
2. /4 Cycles in r Connected Graphs 218
3. Weakly Separable Graphs 223
4. Regular Graphs 225
5. yl Cycles in Cubic 3 Connected Graphs 225
6. A Cycle Through Four Given Edges 230
References 233
Table of Contents IX
Communication Complexity: A Survey 235
Laszlo Lovasz
0. Introduction 235
1. Time Area Tradeoff in VLSI: A Simple Example 236
2. The Notion of Communication Complexity,
Deterministic and Non Deterministic 238
3. A General Upper Bound on Communication Complexity 244
4. Some Protocols 246
5. Mobius Functions and the Rank of the Communication Matrix 249
6. Randomized Protocols 254
7. VLSI Again: How to Split Information? 258
8. Communication Complexity and Computational Complexity 260
References 264
An Outline of a Disjoint Paths Algorithm 267
Neil Robertson and Paul D. Seymour
1. Introduction 267
2. The Two Paths Problem 268
3. Tree Width 269
4. Walls and Tree Width 272
5. Disjoint Paths on a Surface 273
6. Distance on a Surface 274
7. Hypergraphs on a Surface 275
8. Making Use of a Clique 277
9. Finding a Flat Wall 278
10. Finding a Homogeneous Wall 281
11. Disjoint Crossed Paths 283
12. Excluding a Minor 286
13. The Proof of Correctness 289
14. Extensions 290
References 291
Representative of Surface Embeddings 293
Neil Robertson and Richard Vitray
1. Notation 293
2. Problems 295
3. Recognizing Embeddings with p(*P) 1, p(9/) 2, and p{*F) 3. 297
4. Minor Inclusion for Embeddings 299
5. Results from Vitray's Thesis on Projective Plane Embeddings 303
6. Reminder About Low Graph Connectivity 305
7. Essential 1 Components, 2 Components, and 3 Components 307
8. An Algorithm for Computing p(*F)
Running in Polynomial Time in \E(W)\ 312
9. Some Aspects of Representativity in the Graph Minor Papers 312
X Table of Contents
10. Planar Graphs Embedded on Higher Surfaces 313
11. Protective Graphs Embedded in Higher Surfaces 315
12. Toroidal Graphs Embedded in Higher Surfaces 317
13. Unique Embeddings for Orientable Surfaces 318
14. Relevance of the (F, ^ Transformations 319
15. Dan Archdeacon's Example of Embeddings !Pi, 2*2 with
GCP,) 3 G(V2), Z(Vt) + Z(T2) and p(Pi),p(y2) B 324
16. Relationship Between Genus and Representativity 326
References 327
Homotopic Routing Methods 329
Alexander Schrijver
1. Introduction 329
2. Vertex Disjoint Paths and Trees 330
3. Edge Disjoint Paths and Multicommodity Flows 332
4. Edge Disjoint Paths in Planar Graphs 338
5. Vertex Disjoint Homotopic Paths and Trees 345
6. Edge Disjoint Homotopic Paths 364
References 369
Author Index 373
Subject Index 379 |
| any_adam_object | 1 |
| author2 | Korte, Bernhard 1938- |
| author2_role | edt |
| author2_variant | b k bk |
| author_GND | (DE-588)139321802 |
| author_facet | Korte, Bernhard 1938- |
| building | Verbundindex |
| bvnumber | BV004257105 |
| classification_rvk | ST 190 SD 1988 SS 1988 SK 890 |
| classification_tum | ELT 555f MAT 052f |
| ctrlnum | (OCoLC)644309335 (DE-599)BVBBV004257105 |
| discipline | Informatik Elektrotechnik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV004257105</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210222</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910314s1990 d||| |||| 10||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540526854</subfield><subfield code="9">3-540-52685-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387526854</subfield><subfield code="9">0-387-52685-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)644309335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004257105</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 190</subfield><subfield code="0">(DE-625)143607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1988</subfield><subfield code="0">(DE-625)142722:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 1988</subfield><subfield code="0">(DE-625)143425:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">90-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 555f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 052f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Paths, flows and VLSI-layout</subfield><subfield code="b">[the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop]</subfield><subfield code="c">Bernhard Korte [und 3 andere], editors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer-Verlag</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 383 Seiten</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">Algorithms and Combinatorics</subfield><subfield code="v">9</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">Layout</subfield><subfield code="g">Mikroelektronik</subfield><subfield code="0">(DE-588)4264372-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">VLSI</subfield><subfield code="0">(DE-588)4117388-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1988</subfield><subfield code="z">Bonn</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">VLSI</subfield><subfield code="0">(DE-588)4117388-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">VLSI</subfield><subfield code="0">(DE-588)4117388-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Layout</subfield><subfield code="g">Mikroelektronik</subfield><subfield code="0">(DE-588)4264372-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Korte, Bernhard</subfield><subfield code="d">1938-</subfield><subfield code="0">(DE-588)139321802</subfield><subfield code="4">edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">9</subfield><subfield code="w">(DE-604)BV000617357</subfield><subfield code="9">9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=002648204&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1988 Bonn gnd-content |
| genre_facet | Konferenzschrift 1988 Bonn |
| id | DE-604.BV004257105 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T07:22:25Z |
| institution | BVB |
| isbn | 3540526854 0387526854 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002648204 |
| oclc_num | 644309335 |
| open_access_boolean | |
| owner | DE-12 DE-19 DE-BY-UBM DE-384 DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-739 DE-29T DE-20 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-12 DE-19 DE-BY-UBM DE-384 DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-739 DE-29T DE-20 DE-634 DE-83 DE-11 DE-188 |
| physical | XXII, 383 Seiten graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Springer-Verlag |
| record_format | marc |
| series | Algorithms and Combinatorics |
| series2 | Algorithms and Combinatorics |
| spelling | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] Bernhard Korte [und 3 andere], editors Berlin [u.a.] Springer-Verlag 1990 XXII, 383 Seiten graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithms and Combinatorics 9 Literaturangaben Graphentheorie (DE-588)4113782-6 gnd rswk-swf Layout Mikroelektronik (DE-588)4264372-7 gnd rswk-swf VLSI (DE-588)4117388-0 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1988 Bonn gnd-content VLSI (DE-588)4117388-0 s DE-604 Layout Mikroelektronik (DE-588)4264372-7 s Graphentheorie (DE-588)4113782-6 s Korte, Bernhard 1938- (DE-588)139321802 edt Algorithms and Combinatorics 9 (DE-604)BV000617357 9 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002648204&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] Algorithms and Combinatorics Graphentheorie (DE-588)4113782-6 gnd Layout Mikroelektronik (DE-588)4264372-7 gnd VLSI (DE-588)4117388-0 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4264372-7 (DE-588)4117388-0 (DE-588)1071861417 |
| title | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] |
| title_auth | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] |
| title_exact_search | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] |
| title_full | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] Bernhard Korte [und 3 andere], editors |
| title_fullStr | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] Bernhard Korte [und 3 andere], editors |
| title_full_unstemmed | Paths, flows and VLSI-layout [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] Bernhard Korte [und 3 andere], editors |
| title_short | Paths, flows and VLSI-layout |
| title_sort | paths flows and vlsi layout the meeting was held from june 20 to july 1 1988 at the university of bonn in the shape of a summer school and workshop |
| title_sub | [the meeting was held from June 20 to July 1, 1988, at the University of Bonn in the shape of a Summer School and Workshop] |
| topic | Graphentheorie (DE-588)4113782-6 gnd Layout Mikroelektronik (DE-588)4264372-7 gnd VLSI (DE-588)4117388-0 gnd |
| topic_facet | Graphentheorie Layout Mikroelektronik VLSI Konferenzschrift 1988 Bonn |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002648204&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000617357 |
| work_keys_str_mv | AT kortebernhard pathsflowsandvlsilayoutthemeetingwasheldfromjune20tojuly11988attheuniversityofbonnintheshapeofasummerschoolandworkshop |