Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Haifa, Israel
1985
|
| Schriftenreihe: | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report
352 |
| Beschreibung: | 20 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010507775 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951204s1985 |||| 00||| undod | ||
| 035 | |a (OCoLC)633321388 | ||
| 035 | |a (DE-599)BVBBV010507775 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Schieber, E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |c E. Schieber and S. Moran |
| 264 | 1 | |a Haifa, Israel |c 1985 | |
| 300 | |a 20 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |v 352 | |
| 700 | 1 | |a Moran, Shlomo |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> |v 352 |w (DE-604)BV010499135 |9 352 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007003521 | ||
Datensatz im Suchindex
| _version_ | 1804124973580681216 |
|---|---|
| any_adam_object | |
| author | Schieber, E. Moran, Shlomo |
| author_facet | Schieber, E. Moran, Shlomo |
| author_role | aut aut |
| author_sort | Schieber, E. |
| author_variant | e s es s m sm |
| building | Verbundindex |
| bvnumber | BV010507775 |
| ctrlnum | (OCoLC)633321388 (DE-599)BVBBV010507775 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01073nam a2200277 cb4500</leader><controlfield tag="001">BV010507775</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951204s1985 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633321388</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010507775</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schieber, E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks</subfield><subfield code="c">E. Schieber and S. Moran</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Haifa, Israel</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 Bl.</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">haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report</subfield><subfield code="v">352</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moran, Shlomo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t"><<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā></subfield><subfield code="v">352</subfield><subfield code="w">(DE-604)BV010499135</subfield><subfield code="9">352</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007003521</subfield></datafield></record></collection> |
| id | DE-604.BV010507775 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:54:10Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007003521 |
| oclc_num | 633321388 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 Bl. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |
| spelling | Schieber, E. Verfasser aut Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks E. Schieber and S. Moran Haifa, Israel 1985 20 Bl. txt rdacontent n rdamedia nc rdacarrier haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report 352 Moran, Shlomo Verfasser aut Department of Computer Science: Technical report <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> 352 (DE-604)BV010499135 352 |
| spellingShingle | Schieber, E. Moran, Shlomo Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |
| title | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |
| title_auth | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |
| title_exact_search | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |
| title_full | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks E. Schieber and S. Moran |
| title_fullStr | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks E. Schieber and S. Moran |
| title_full_unstemmed | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks E. Schieber and S. Moran |
| title_short | Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks |
| title_sort | parallel algorithm for finding maximum bipartite matchings and maximum flow in 0 1 networks |
| volume_link | (DE-604)BV010499135 |
| work_keys_str_mv | AT schiebere parallelalgorithmforfindingmaximumbipartitematchingsandmaximumflowin01networks AT moranshlomo parallelalgorithmforfindingmaximumbipartitematchingsandmaximumflowin01networks |