Fast parallel algorithms for graph matching problems:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Oxford [u.a.]
Clarendon Press
1998
|
| Schriftenreihe: | Oxford lecture series in mathematics and its applications
9 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 212 S. graph. Darst. |
| ISBN: | 0198501625 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011988149 | ||
| 003 | DE-604 | ||
| 005 | 20100916 | ||
| 007 | t | ||
| 008 | 980603s1998 d||| |||| 00||| eng d | ||
| 020 | |a 0198501625 |9 0-19-850162-5 | ||
| 035 | |a (OCoLC)39156486 | ||
| 035 | |a (DE-599)BVBBV011988149 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-703 |a DE-20 |a DE-91G |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA164 | |
| 082 | 0 | |a 511.5028551 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a DAT 516f |2 stub | ||
| 084 | |a 68R10 |2 msc | ||
| 084 | |a 05C70 |2 msc | ||
| 084 | |a DAT 537f |2 stub | ||
| 100 | 1 | |a Karpiński, Marek |d 1948- |e Verfasser |0 (DE-588)115476032 |4 aut | |
| 245 | 1 | 0 | |a Fast parallel algorithms for graph matching problems |c Marek Karpinski and Wojciech Rytter |
| 264 | 1 | |a Oxford [u.a.] |b Clarendon Press |c 1998 | |
| 300 | |a XI, 212 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Oxford lecture series in mathematics and its applications |v 9 | |
| 490 | 0 | |a Oxford Science publications | |
| 650 | 7 | |a Algorithmes parallèles |2 ram | |
| 650 | 7 | |a Couplage, Théorie du |2 ram | |
| 650 | 7 | |a Graphes, Théorie des |2 ram | |
| 650 | 7 | |a algorithme parallèle |2 inriac | |
| 650 | 7 | |a algorithme rapide |2 inriac | |
| 650 | 7 | |a appariement |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Matching theory | |
| 650 | 4 | |a Parallel algorithms | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching-Problem |0 (DE-588)4198185-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Matching-Problem |0 (DE-588)4198185-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Matching-Problem |0 (DE-588)4198185-6 |D s |
| 689 | 1 | 2 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Rytter, Wojciech |e Verfasser |4 aut | |
| 830 | 0 | |a Oxford lecture series in mathematics and its applications |v 9 |w (DE-604)BV009910017 |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=008112072&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008112072 | ||
Datensatz im Suchindex
| _version_ | 1804126582503112704 |
|---|---|
| adam_text | Contents
1 Introduction 1
1.1 Matchings in graphs: terminology, examples 1
1.2 The model of parallel computations: PRAM 4
1.3 The complexity classes NC and RNC 6
1.4 Bibliographic notes 7
2 Combinatorial tools 8
2.1 Augmenting paths 8
2.2 Deficiencies and witness sets 11
2.3 Bipartite graphs and their witness sets 13
2.4 Tutte s theorem and witness sets in general graphs 15
2.5 Odd set covers 19
2.6 Good edges lemma 20
2.7 Bibliographic notes 21
3 Three sequential algorithms 22
3.1 Hopcroft Karp algorithm 23
3.2 Edmonds algorithm and blossoms 26
3.3 Structural algorithm (no blossoms) 32
3.4 Bibliographic notes 40
4 Probabilistic tools 41
4.1 Probabilistic tools 41
4.2 The isolating theorem 42
4.3 The redundancy theorem 45
4.4 Randomized handshaking 48
4.5 Estimating the probability of nonzero sums 50
4.6 Removing a large proportion of elements 51
4.7 Derandomization 52
4.8 Bibliographic notes 54
5 Algebraic tools 55
5.1 Determinants versus permanents 55
5.2 Symbolic polynomials of set families 57
5.3 Nonzero test and partial interpolation of polynomials 60
5.4 Sparse polynomials 63
5.5 Randomized computation of the smallest degree 65
5.6 Ranks of matrices 67
5.7 NC computation of determinants 68
5.8 Bibliographic notes 72
6 Maximum cardinality matchings 73
6.1 Constructing black box polynomials 73
6.2 Bimatchings and Pfaffians 79
6.3 Applying partial interpolation 83
6.4 Graphs with a small number of perfect matchings 85
6.5 From Monte Carlo to Las Vegas 86
6.6 The shrinking algorithm 88
6.7 Application of the smallest degree algorithm 90
6.8 Bibliographic notes 93
7 Inclusion maximal matchings 94
7.1 Deterministic algorithm for maximal matchings 94
7.2 An application of randomized handshaking 101
7.3 Bibliographic notes 103
8 Maximal independent sets 104
8.1 Two algorithms of Luby 104
8.2 Deterministic algorithm for maximal independent sets 107
8.3 Maximal independent sets in hypergraphs 111
8.4 Maximal ^ dependent sets 112
8.5 Bibliographic notes 115
9 Four easy subclasses of graphs 116
9.1 Trees 116
9.2 Dense graphs 117
9.3 Regular bipartite graphs 120
9.4 Claw free graphs and pseudo matchings 124
9.5 Bibliographic notes 130
10 Families of intervals 131
10.1 The greedy sequential algorithm 132
10.2 Left justification of set families 133
10.3 The parallel algorithm for the general case 136
10.4 Bibliographic notes 138
11 Parallel algorithms for / matchings 139
11.1 ft/VC algorithm for maximum / matchings 140
11.2 Simple /WC algorithm for maximal / matchings 141
11.3 Deterministic JVC algorithm for maximal / matchings 144
11.4 Bibliographic notes 150
12 Parallelization of sequential algorithms 151
12.1 Parallelizing the Hopcroft Karp algorithm 151
12.2 Parallel implementation of BFS and Disjoint.Paths 152
12.3 yVC approximation of maximum matching 156
12.4 Bipartite expander graphs 158
12.5 Applying the planar separator theorem 159
12.6 Parallel version of the Edmonds algorithm 162
12.7 Bibliographic notes 163
13 Pfaffians, counting the number of matchings, and pla¬
nar graphs 164
13.1 Pfaffians of graphs 164
13.2 Skew symmetric determinants and Pfaffians 165
13.3 Pfaffians and counting the number of perfect matchings 166
13.4 Bibliographic notes 170
14 Basic applications of parallel matching 171
14.1 The subtree isomorphism problem 171
14.2 Maximum flows and disjoint paths 175
14.3 Parallel construction of DFS trees 180
14.4 Bibliographic notes 186
15 More applications 187
15.1 Unary Chinese postman problem 187
15.2 Two processor scheduling 188
15.3 Cycle covers and shortest superstrings 190
15.4 The | approximation of the metric TSP 192
15.5 The bandwidth problem 193
15.6 Spanning 3 hypertrees and approximating Steiner tree 195
15.7 Bibliographic notes 197
Bibliography 198
Index 207
|
| any_adam_object | 1 |
| author | Karpiński, Marek 1948- Rytter, Wojciech |
| author_GND | (DE-588)115476032 |
| author_facet | Karpiński, Marek 1948- Rytter, Wojciech |
| author_role | aut aut |
| author_sort | Karpiński, Marek 1948- |
| author_variant | m k mk w r wr |
| building | Verbundindex |
| bvnumber | BV011988149 |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164 |
| callnumber-search | QA164 |
| callnumber-sort | QA 3164 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | DAT 516f DAT 537f |
| ctrlnum | (OCoLC)39156486 (DE-599)BVBBV011988149 |
| dewey-full | 511.5028551 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5028551 |
| dewey-search | 511.5028551 |
| dewey-sort | 3511.5028551 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02466nam a2200637 cb4500</leader><controlfield tag="001">BV011988149</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100916 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980603s1998 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0198501625</subfield><subfield code="9">0-19-850162-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)39156486</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011988149</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-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA164</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5028551</subfield><subfield code="2">21</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">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05C70</subfield><subfield code="2">msc</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">Karpiński, Marek</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115476032</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast parallel algorithms for graph matching problems</subfield><subfield code="c">Marek Karpinski and Wojciech Rytter</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford [u.a.]</subfield><subfield code="b">Clarendon Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 212 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">Oxford lecture series in mathematics and its applications</subfield><subfield code="v">9</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Oxford Science publications</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes parallèles</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Couplage, Théorie du</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme rapide</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">appariement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matching theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</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">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</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">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</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">Rytter, Wojciech</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Oxford lecture series in mathematics and its applications</subfield><subfield code="v">9</subfield><subfield code="w">(DE-604)BV009910017</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=008112072&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-008112072</subfield></datafield></record></collection> |
| id | DE-604.BV011988149 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:19:45Z |
| institution | BVB |
| isbn | 0198501625 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008112072 |
| oclc_num | 39156486 |
| open_access_boolean | |
| owner | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-83 DE-11 |
| owner_facet | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-83 DE-11 |
| physical | XI, 212 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Clarendon Press |
| record_format | marc |
| series | Oxford lecture series in mathematics and its applications |
| series2 | Oxford lecture series in mathematics and its applications Oxford Science publications |
| spelling | Karpiński, Marek 1948- Verfasser (DE-588)115476032 aut Fast parallel algorithms for graph matching problems Marek Karpinski and Wojciech Rytter Oxford [u.a.] Clarendon Press 1998 XI, 212 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Oxford lecture series in mathematics and its applications 9 Oxford Science publications Algorithmes parallèles ram Couplage, Théorie du ram Graphes, Théorie des ram algorithme parallèle inriac algorithme rapide inriac appariement inriac théorie graphe inriac Graph theory Matching theory Parallel algorithms Graphentheorie (DE-588)4113782-6 gnd rswk-swf Matching-Problem (DE-588)4198185-6 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Matching-Problem (DE-588)4198185-6 s DE-604 Paralleler Algorithmus (DE-588)4193615-2 s Rytter, Wojciech Verfasser aut Oxford lecture series in mathematics and its applications 9 (DE-604)BV009910017 9 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008112072&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Karpiński, Marek 1948- Rytter, Wojciech Fast parallel algorithms for graph matching problems Oxford lecture series in mathematics and its applications Algorithmes parallèles ram Couplage, Théorie du ram Graphes, Théorie des ram algorithme parallèle inriac algorithme rapide inriac appariement inriac théorie graphe inriac Graph theory Matching theory Parallel algorithms Graphentheorie (DE-588)4113782-6 gnd Matching-Problem (DE-588)4198185-6 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4198185-6 (DE-588)4193615-2 |
| title | Fast parallel algorithms for graph matching problems |
| title_auth | Fast parallel algorithms for graph matching problems |
| title_exact_search | Fast parallel algorithms for graph matching problems |
| title_full | Fast parallel algorithms for graph matching problems Marek Karpinski and Wojciech Rytter |
| title_fullStr | Fast parallel algorithms for graph matching problems Marek Karpinski and Wojciech Rytter |
| title_full_unstemmed | Fast parallel algorithms for graph matching problems Marek Karpinski and Wojciech Rytter |
| title_short | Fast parallel algorithms for graph matching problems |
| title_sort | fast parallel algorithms for graph matching problems |
| topic | Algorithmes parallèles ram Couplage, Théorie du ram Graphes, Théorie des ram algorithme parallèle inriac algorithme rapide inriac appariement inriac théorie graphe inriac Graph theory Matching theory Parallel algorithms Graphentheorie (DE-588)4113782-6 gnd Matching-Problem (DE-588)4198185-6 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd |
| topic_facet | Algorithmes parallèles Couplage, Théorie du Graphes, Théorie des algorithme parallèle algorithme rapide appariement théorie graphe Graph theory Matching theory Parallel algorithms Graphentheorie Matching-Problem Paralleler Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008112072&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV009910017 |
| work_keys_str_mv | AT karpinskimarek fastparallelalgorithmsforgraphmatchingproblems AT rytterwojciech fastparallelalgorithmsforgraphmatchingproblems |