An outline of a disjoint path algorithm:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
Bonn
1988
|
| Schriftenreihe: | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report
523 |
| Umfang: | 27 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004271014 | ||
| 003 | DE-604 | ||
| 005 | 19930811 | ||
| 007 | t| | ||
| 008 | 910313s1988 xx d||| |||| 00||| ger d | ||
| 035 | |a (OCoLC)46141634 | ||
| 035 | |a (DE-599)BVBBV004271014 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-523 | ||
| 088 | |a 88523 OR | ||
| 100 | 1 | |a Robertson, Neil |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An outline of a disjoint path algorithm |c N. Robertson ; P. D. Seymour |
| 264 | 1 | |a Bonn |c 1988 | |
| 300 | |a 27 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |v 523 | |
| 700 | 1 | |a Seymour, Paul D. |d 1950- |e Verfasser |0 (DE-588)135823757 |4 aut | |
| 830 | 0 | |a Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |v 523 |w (DE-604)BV001337780 |9 523 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-002655284 | |
Datensatz im Suchindex
| _version_ | 1818946484945551360 |
|---|---|
| any_adam_object | |
| author | Robertson, Neil Seymour, Paul D. 1950- |
| author_GND | (DE-588)135823757 |
| author_facet | Robertson, Neil Seymour, Paul D. 1950- |
| author_role | aut aut |
| author_sort | Robertson, Neil |
| author_variant | n r nr p d s pd pds |
| building | Verbundindex |
| bvnumber | BV004271014 |
| ctrlnum | (OCoLC)46141634 (DE-599)BVBBV004271014 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00955nam a2200289 cb4500</leader><controlfield tag="001">BV004271014</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19930811 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">910313s1988 xx d||| |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46141634</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004271014</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">88523 OR</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Robertson, Neil</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An outline of a disjoint path algorithm</subfield><subfield code="c">N. Robertson ; P. D. Seymour</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">Forschungsinstitut für Diskrete Mathematik <Bonn>: Report</subfield><subfield code="v">523</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Seymour, Paul D.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135823757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Forschungsinstitut für Diskrete Mathematik <Bonn>: Report</subfield><subfield code="v">523</subfield><subfield code="w">(DE-604)BV001337780</subfield><subfield code="9">523</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002655284</subfield></datafield></record></collection> |
| id | DE-604.BV004271014 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T08:15:45Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002655284 |
| oclc_num | 46141634 |
| open_access_boolean | |
| owner | DE-12 DE-523 |
| owner_facet | DE-12 DE-523 |
| physical | 27 S. graph. Darst. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| series2 | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| spelling | Robertson, Neil Verfasser aut An outline of a disjoint path algorithm N. Robertson ; P. D. Seymour Bonn 1988 27 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 523 Seymour, Paul D. 1950- Verfasser (DE-588)135823757 aut Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 523 (DE-604)BV001337780 523 |
| spellingShingle | Robertson, Neil Seymour, Paul D. 1950- An outline of a disjoint path algorithm Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| title | An outline of a disjoint path algorithm |
| title_auth | An outline of a disjoint path algorithm |
| title_exact_search | An outline of a disjoint path algorithm |
| title_full | An outline of a disjoint path algorithm N. Robertson ; P. D. Seymour |
| title_fullStr | An outline of a disjoint path algorithm N. Robertson ; P. D. Seymour |
| title_full_unstemmed | An outline of a disjoint path algorithm N. Robertson ; P. D. Seymour |
| title_short | An outline of a disjoint path algorithm |
| title_sort | an outline of a disjoint path algorithm |
| volume_link | (DE-604)BV001337780 |
| work_keys_str_mv | AT robertsonneil anoutlineofadisjointpathalgorithm AT seymourpauld anoutlineofadisjointpathalgorithm |