Sublinear-time parallel algorithms for matching and related problems:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
Lab. for Computer Science, Massachusetts Inst. of Technology
1988
|
| Schlagwörter: | |
| Abstract: | This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublinear-time deterministic parallel algorithms for dining a minimum-weight bipartite matching and for finding a minimum-cost flow in a network with zero-one capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR). |
| Umfang: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021892135 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t| | ||
| 008 | 900726s1988 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)227723000 | ||
| 035 | |a (DE-599)BVBBV021892135 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-357 | ||
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Sublinear-time parallel algorithms for matching and related problems |c Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya |
| 264 | 1 | |a Cambridge, Mass. |b Lab. for Computer Science, Massachusetts Inst. of Technology |c 1988 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublinear-time deterministic parallel algorithms for dining a minimum-weight bipartite matching and for finding a minimum-cost flow in a network with zero-one capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Combinatorial analysis |2 dtict | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Flow |2 dtict | |
| 650 | 7 | |a Lightweight |2 dtict | |
| 650 | 7 | |a Low costs |2 dtict | |
| 650 | 7 | |a Matching |2 dtict | |
| 650 | 7 | |a Network flows |2 dtict | |
| 650 | 7 | |a Networks |2 dtict | |
| 650 | 7 | |a Nodes |2 dtict | |
| 650 | 7 | |a Numbers |2 dtict | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prüfung |0 (DE-588)4047609-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Prüfung |0 (DE-588)4047609-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 700 | 1 | |a Vaidya, Pravin M. |e Verfasser |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015107333 | |
Datensatz im Suchindex
| _version_ | 1818963377799561216 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. |
| author_facet | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. |
| author_role | aut aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg s a p sa sap p m v pm pmv |
| building | Verbundindex |
| bvnumber | BV021892135 |
| ctrlnum | (OCoLC)227723000 (DE-599)BVBBV021892135 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02922nam a2200577zc 4500</leader><controlfield tag="001">BV021892135</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">900726s1988 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227723000</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021892135</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-357</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sublinear-time parallel algorithms for matching and related problems</subfield><subfield code="c">Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Lab. for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</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="520" ind1="3" ind2=" "><subfield code="a">This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublinear-time deterministic parallel algorithms for dining a minimum-weight bipartite matching and for finding a minimum-cost flow in a network with zero-one capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Flow</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lightweight</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Low costs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matching</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Network flows</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Networks</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nodes</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numbers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prüfung</subfield><subfield code="0">(DE-588)4047609-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Prüfung</subfield><subfield code="0">(DE-588)4047609-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vaidya, Pravin M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015107333</subfield></datafield></record></collection> |
| id | DE-604.BV021892135 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:44:15Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015107333 |
| oclc_num | 227723000 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 25 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | Lab. for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Goldberg, Andrew V. Verfasser aut Sublinear-time parallel algorithms for matching and related problems Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya Cambridge, Mass. Lab. for Computer Science, Massachusetts Inst. of Technology 1988 25 S. txt rdacontent n rdamedia nc rdacarrier This paper presents the first sublinear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. We also show how to apply our techniques to design parallel algorithms for the weighted versions of the above problems. In particular, we present sublinear-time deterministic parallel algorithms for dining a minimum-weight bipartite matching and for finding a minimum-cost flow in a network with zero-one capacities, if the weights are polynomially bounded integers. Keywords: Network flows. (KR). Algorithms dtict Combinatorial analysis dtict Computer Systems scgdst Flow dtict Lightweight dtict Low costs dtict Matching dtict Network flows dtict Networks dtict Nodes dtict Numbers dtict Parallel processing dtict Algorithmus (DE-588)4001183-5 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Prüfung (DE-588)4047609-1 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Prüfung (DE-588)4047609-1 s Parallelverarbeitung (DE-588)4075860-6 s Netzwerk (DE-588)4171529-9 s Plotkin, Serge A. Verfasser aut Vaidya, Pravin M. Verfasser aut |
| spellingShingle | Goldberg, Andrew V. Plotkin, Serge A. Vaidya, Pravin M. Sublinear-time parallel algorithms for matching and related problems Algorithms dtict Combinatorial analysis dtict Computer Systems scgdst Flow dtict Lightweight dtict Low costs dtict Matching dtict Network flows dtict Networks dtict Nodes dtict Numbers dtict Parallel processing dtict Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Prüfung (DE-588)4047609-1 gnd Netzwerk (DE-588)4171529-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4075860-6 (DE-588)4047609-1 (DE-588)4171529-9 |
| title | Sublinear-time parallel algorithms for matching and related problems |
| title_auth | Sublinear-time parallel algorithms for matching and related problems |
| title_exact_search | Sublinear-time parallel algorithms for matching and related problems |
| title_full | Sublinear-time parallel algorithms for matching and related problems Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya |
| title_fullStr | Sublinear-time parallel algorithms for matching and related problems Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya |
| title_full_unstemmed | Sublinear-time parallel algorithms for matching and related problems Andrew V. Goldberg ; Serge A. Plotkin ; Pravin M. Vaidya |
| title_short | Sublinear-time parallel algorithms for matching and related problems |
| title_sort | sublinear time parallel algorithms for matching and related problems |
| topic | Algorithms dtict Combinatorial analysis dtict Computer Systems scgdst Flow dtict Lightweight dtict Low costs dtict Matching dtict Network flows dtict Networks dtict Nodes dtict Numbers dtict Parallel processing dtict Algorithmus (DE-588)4001183-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Prüfung (DE-588)4047609-1 gnd Netzwerk (DE-588)4171529-9 gnd |
| topic_facet | Algorithms Combinatorial analysis Computer Systems Flow Lightweight Low costs Matching Network flows Networks Nodes Numbers Parallel processing Algorithmus Parallelverarbeitung Prüfung Netzwerk |
| work_keys_str_mv | AT goldbergandrewv sublineartimeparallelalgorithmsformatchingandrelatedproblems AT plotkinsergea sublineartimeparallelalgorithmsformatchingandrelatedproblems AT vaidyapravinm sublineartimeparallelalgorithmsformatchingandrelatedproblems |