Algorithmic aspects of graph connectivity:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge [u.a.]
Cambridge Univ. Press
2008
|
| Edition: | 1. publ. |
| Series: | Encyclopedia of mathematics and its applications
123 |
| Subjects: | |
| Online Access: | Contributor biographical information Publisher description Table of contents only Inhaltsverzeichnis |
| Item Description: | Includes index. |
| Physical Description: | XV, 375 S. graph. Darst. |
| ISBN: | 9780521878647 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV035101526 | ||
| 003 | DE-604 | ||
| 005 | 20090210 | ||
| 007 | t | ||
| 008 | 081015s2008 xxud||| |||| 00||| eng d | ||
| 010 | |a 2008007560 | ||
| 020 | |a 9780521878647 |c hardback |9 978-0-521-87864-7 | ||
| 035 | |a (OCoLC)212015401 | ||
| 035 | |a (DE-599)BVBBV035101526 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 |a DE-29T |a DE-91G | ||
| 050 | 0 | |a QA166.243 | |
| 082 | 0 | |a 511/.5 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a DAT 537f |2 stub | ||
| 100 | 1 | |a Nagamochi, Hiroshi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithmic aspects of graph connectivity |c Hiroshi Nagamochi ; Toshihide Ibaraki |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2008 | |
| 300 | |a XV, 375 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications |v 123 | |
| 500 | |a Includes index. | ||
| 650 | 4 | |a Graph connectivity | |
| 650 | 4 | |a Graph algorithms | |
| 650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Ibaraki, Toshihide |e Sonstige |4 oth | |
| 830 | 0 | |a Encyclopedia of mathematics and its applications |v 123 |w (DE-604)BV000903719 |9 123 | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0810/2008007560-b.html |3 Contributor biographical information | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0810/2008007560-d.html |3 Publisher description | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0810/2008007560-t.html |3 Table of contents only | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016769497&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016769497 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804138063926919168 |
|---|---|
| adam_text | Contents
Preface
page
ix
Notation
xi
1
Introduction
1
1.1
Preliminaries of Graph Theory
1
1.2
Algorithms and Complexities
13
1.3
Flows and Cuts
20
1.4
Computing Connectivities
34
1.5
Representations of Cut Structures
45
1.6
Connectivity by Trees
57
1.7
Tree Hypergraphs
60
2
Maximum Adjacency Ordering and Forest Decompositions
65
2.1
Spanning Subgraphs Preserving Connectivity
65
2.2
MA Ordering
73
2.3
3-Edge-Connected Components
86
2.4
2-Approximation Algorithms for Connectivity
100
2.5
Fast Maximum-Flow Algorithms
107
2.6
Testing Chordality
112
3
Minimum Cuts
114
3.1
Pendent Pairs in
MA Orderings
114
3.2
A Minimum-Cut Algorithm
117
3.3
s-Proper ^-Edge-Connected Spanning Subgraphs
119
3.4
A Hierarchical Structure of
MA Orderings
123
3.5
Maximum Flows Between a Pendent Pair
127
3.6
A Generalization of Pendent Pairs
130
3.7
Practically Efficient Minimum-Cut Algorithms
131
4
Cut Enumeration
137
4.1
Enumerating All Cuts
137
4.2
Enumerating Small Cuts
140
vii
viii Contents
4.3
Enumerating Minimum Cuts
145
4.4
Upper Bounds on the Number of Small Cuts
149
5
Cactus Representations
153
5.1
Canonical Forms of Cactus Representations
153
5.2
(s, t )-Cactus
Representations
171
5.3
Constructing Cactus Representations
180
6
Extreme Vertex Sets
191
6.1
Computing Extreme Vertex Sets in Graphs
192
6.2
Algorithm for Dynamic Edges Incident to a Specified Vertex
198
6.3
Optimal Contraction Ordering
200
6.4
Minimum ^-Subpartition Problem
207
7
Edge Splitting
217
7.1
Preliminaries
217
7.2
Edge Splitting in Weighted Graphs
220
7.3
Edge Splitting in Multigraphs
226
7.4
Other Splittings
232
7.5
Detachments
237
7.6
Applications of Splittings
240
8
Connectivity Augmentation
246
8.1
Increasing Edge-Connectivity by One
247
8.2
Star Augmentation
249
8.3
Augmenting Multigraphs
252
8.4
Augmenting Weighted Graphs
254
8.5
More on Augmentation
276
9
Source Location Problems
282
9.1
Source Location Problem Under Edge-Connectivity
Requirements
283
9.2
Source Location Problem Under Vertex-Connectivity
Requirements
295
10
Submodular
and Posimodular Set Functions
304
10.1
Set Functions
304
10.2
Minimizing
Submodular
and Posimodular Functions
306
10.3
Extreme Subsets in
Submodular
and Posimodular Systems
315
10.4
Optimization Problems over
Submodular
and Posimodular
Systems
320
10.5
Extreme Points of Base Polyhedron
336
10.6
Minimum Transversal in Set Systems
342
Bibliography
357
Index
371
|
| adam_txt |
Contents
Preface
page
ix
Notation
xi
1
Introduction
1
1.1
Preliminaries of Graph Theory
1
1.2
Algorithms and Complexities
13
1.3
Flows and Cuts
20
1.4
Computing Connectivities
34
1.5
Representations of Cut Structures
45
1.6
Connectivity by Trees
57
1.7
Tree Hypergraphs
60
2
Maximum Adjacency Ordering and Forest Decompositions
65
2.1
Spanning Subgraphs Preserving Connectivity
65
2.2
MA Ordering
73
2.3
3-Edge-Connected Components
86
2.4
2-Approximation Algorithms for Connectivity
100
2.5
Fast Maximum-Flow Algorithms
107
2.6
Testing Chordality
112
3
Minimum Cuts
114
3.1
Pendent Pairs in
MA Orderings
114
3.2
A Minimum-Cut Algorithm
117
3.3
s-Proper ^-Edge-Connected Spanning Subgraphs
119
3.4
A Hierarchical Structure of
MA Orderings
123
3.5
Maximum Flows Between a Pendent Pair
127
3.6
A Generalization of Pendent Pairs
130
3.7
Practically Efficient Minimum-Cut Algorithms
131
4
Cut Enumeration
137
4.1
Enumerating All Cuts
137
4.2
Enumerating Small Cuts
140
vii
viii Contents
4.3
Enumerating Minimum Cuts
145
4.4
Upper Bounds on the Number of Small Cuts
149
5
Cactus Representations
153
5.1
Canonical Forms of Cactus Representations
153
5.2
(s, t )-Cactus
Representations
171
5.3
Constructing Cactus Representations
180
6
Extreme Vertex Sets
191
6.1
Computing Extreme Vertex Sets in Graphs
192
6.2
Algorithm for Dynamic Edges Incident to a Specified Vertex
198
6.3
Optimal Contraction Ordering
200
6.4
Minimum ^-Subpartition Problem
207
7
Edge Splitting
217
7.1
Preliminaries
217
7.2
Edge Splitting in Weighted Graphs
220
7.3
Edge Splitting in Multigraphs
226
7.4
Other Splittings
232
7.5
Detachments
237
7.6
Applications of Splittings
240
8
Connectivity Augmentation
246
8.1
Increasing Edge-Connectivity by One
247
8.2
Star Augmentation
249
8.3
Augmenting Multigraphs
252
8.4
Augmenting Weighted Graphs
254
8.5
More on Augmentation
276
9
Source Location Problems
282
9.1
Source Location Problem Under Edge-Connectivity
Requirements
283
9.2
Source Location Problem Under Vertex-Connectivity
Requirements
295
10
Submodular
and Posimodular Set Functions
304
10.1
Set Functions
304
10.2
Minimizing
Submodular
and Posimodular Functions
306
10.3
Extreme Subsets in
Submodular
and Posimodular Systems
315
10.4
Optimization Problems over
Submodular
and Posimodular
Systems
320
10.5
Extreme Points of Base Polyhedron
336
10.6
Minimum Transversal in Set Systems
342
Bibliography
357
Index
371 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Nagamochi, Hiroshi |
| author_facet | Nagamochi, Hiroshi |
| author_role | aut |
| author_sort | Nagamochi, Hiroshi |
| author_variant | h n hn |
| building | Verbundindex |
| bvnumber | BV035101526 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.243 |
| callnumber-search | QA166.243 |
| callnumber-sort | QA 3166.243 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 055f DAT 537f |
| ctrlnum | (OCoLC)212015401 (DE-599)BVBBV035101526 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02468nam a2200589zcb4500</leader><controlfield tag="001">BV035101526</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090210 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081015s2008 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2008007560</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521878647</subfield><subfield code="c">hardback</subfield><subfield code="9">978-0-521-87864-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)212015401</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035101526</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.243</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</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">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nagamochi, Hiroshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic aspects of graph connectivity</subfield><subfield code="c">Hiroshi Nagamochi ; Toshihide Ibaraki</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 375 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">Encyclopedia of mathematics and its applications</subfield><subfield code="v">123</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ibaraki, Toshihide</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">123</subfield><subfield code="w">(DE-604)BV000903719</subfield><subfield code="9">123</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0810/2008007560-b.html</subfield><subfield code="3">Contributor biographical information</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0810/2008007560-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0810/2008007560-t.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</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=016769497&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-016769497</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV035101526 |
| illustrated | Illustrated |
| index_date | 2024-07-02T22:14:21Z |
| indexdate | 2024-07-09T21:22:14Z |
| institution | BVB |
| isbn | 9780521878647 |
| language | English |
| lccn | 2008007560 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016769497 |
| oclc_num | 212015401 |
| open_access_boolean | |
| owner | DE-703 DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-703 DE-29T DE-91G DE-BY-TUM |
| physical | XV, 375 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Nagamochi, Hiroshi Verfasser aut Algorithmic aspects of graph connectivity Hiroshi Nagamochi ; Toshihide Ibaraki 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2008 XV, 375 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Encyclopedia of mathematics and its applications 123 Includes index. Graph connectivity Graph algorithms Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 s Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Graphentheorie (DE-588)4113782-6 s 1\p DE-604 Ibaraki, Toshihide Sonstige oth Encyclopedia of mathematics and its applications 123 (DE-604)BV000903719 123 http://www.loc.gov/catdir/enhancements/fy0810/2008007560-b.html Contributor biographical information http://www.loc.gov/catdir/enhancements/fy0810/2008007560-d.html Publisher description http://www.loc.gov/catdir/enhancements/fy0810/2008007560-t.html Table of contents only Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016769497&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Nagamochi, Hiroshi Algorithmic aspects of graph connectivity Encyclopedia of mathematics and its applications Graph connectivity Graph algorithms Algorithmische Geometrie (DE-588)4130267-9 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4130267-9 (DE-588)4021842-9 (DE-588)4113782-6 |
| title | Algorithmic aspects of graph connectivity |
| title_auth | Algorithmic aspects of graph connectivity |
| title_exact_search | Algorithmic aspects of graph connectivity |
| title_exact_search_txtP | Algorithmic aspects of graph connectivity |
| title_full | Algorithmic aspects of graph connectivity Hiroshi Nagamochi ; Toshihide Ibaraki |
| title_fullStr | Algorithmic aspects of graph connectivity Hiroshi Nagamochi ; Toshihide Ibaraki |
| title_full_unstemmed | Algorithmic aspects of graph connectivity Hiroshi Nagamochi ; Toshihide Ibaraki |
| title_short | Algorithmic aspects of graph connectivity |
| title_sort | algorithmic aspects of graph connectivity |
| topic | Graph connectivity Graph algorithms Algorithmische Geometrie (DE-588)4130267-9 gnd Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Graph connectivity Graph algorithms Algorithmische Geometrie Graph Graphentheorie |
| url | http://www.loc.gov/catdir/enhancements/fy0810/2008007560-b.html http://www.loc.gov/catdir/enhancements/fy0810/2008007560-d.html http://www.loc.gov/catdir/enhancements/fy0810/2008007560-t.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016769497&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000903719 |
| work_keys_str_mv | AT nagamochihiroshi algorithmicaspectsofgraphconnectivity AT ibarakitoshihide algorithmicaspectsofgraphconnectivity |