A practical linear time algorithm for disjoint paths in graphs with bounded tree width:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Technische Universität
1994
|
| Ausgabe: | als Manuskript vervielfältigt |
| Schriftenreihe: | Preprint-Reihe Mathematik
396 |
| Beschreibung: | 17 Seiten Diagramme |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010025558 | ||
| 003 | DE-604 | ||
| 005 | 20210122 | ||
| 007 | t | ||
| 008 | 950206s1994 |||| |||| 00||| engod | ||
| 035 | |a (OCoLC)165235990 | ||
| 035 | |a (DE-599)BVBBV010025558 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-83 |a DE-188 | ||
| 100 | 1 | |a Scheffler, Petra |0 (DE-588)1182433200 |4 aut | |
| 245 | 1 | 0 | |a A practical linear time algorithm for disjoint paths in graphs with bounded tree width |c by Petra Scheffler |
| 250 | |a als Manuskript vervielfältigt | ||
| 264 | 1 | |a Berlin |b Technische Universität |c 1994 | |
| 300 | |a 17 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Preprint-Reihe Mathematik |v 396 | |
| 830 | 0 | |a Preprint-Reihe Mathematik |v 396 |w (DE-604)BV009130191 |9 396 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006647639 | ||
Datensatz im Suchindex
| _version_ | 1804124406025289728 |
|---|---|
| any_adam_object | |
| author | Scheffler, Petra |
| author_GND | (DE-588)1182433200 |
| author_facet | Scheffler, Petra |
| author_role | aut |
| author_sort | Scheffler, Petra |
| author_variant | p s ps |
| building | Verbundindex |
| bvnumber | BV010025558 |
| ctrlnum | (OCoLC)165235990 (DE-599)BVBBV010025558 |
| edition | als Manuskript vervielfältigt |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00914nam a2200277 cb4500</leader><controlfield tag="001">BV010025558</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210122 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950206s1994 |||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165235990</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010025558</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scheffler, Petra</subfield><subfield code="0">(DE-588)1182433200</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A practical linear time algorithm for disjoint paths in graphs with bounded tree width</subfield><subfield code="c">by Petra Scheffler</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">als Manuskript vervielfältigt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Technische Universität</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 Seiten</subfield><subfield code="b">Diagramme</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">Preprint-Reihe Mathematik</subfield><subfield code="v">396</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Preprint-Reihe Mathematik</subfield><subfield code="v">396</subfield><subfield code="w">(DE-604)BV009130191</subfield><subfield code="9">396</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006647639</subfield></datafield></record></collection> |
| id | DE-604.BV010025558 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:45:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006647639 |
| oclc_num | 165235990 |
| open_access_boolean | |
| owner | DE-12 DE-83 DE-188 |
| owner_facet | DE-12 DE-83 DE-188 |
| physical | 17 Seiten Diagramme |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Technische Universität |
| record_format | marc |
| series | Preprint-Reihe Mathematik |
| series2 | Preprint-Reihe Mathematik |
| spelling | Scheffler, Petra (DE-588)1182433200 aut A practical linear time algorithm for disjoint paths in graphs with bounded tree width by Petra Scheffler als Manuskript vervielfältigt Berlin Technische Universität 1994 17 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Preprint-Reihe Mathematik 396 Preprint-Reihe Mathematik 396 (DE-604)BV009130191 396 |
| spellingShingle | Scheffler, Petra A practical linear time algorithm for disjoint paths in graphs with bounded tree width Preprint-Reihe Mathematik |
| title | A practical linear time algorithm for disjoint paths in graphs with bounded tree width |
| title_auth | A practical linear time algorithm for disjoint paths in graphs with bounded tree width |
| title_exact_search | A practical linear time algorithm for disjoint paths in graphs with bounded tree width |
| title_full | A practical linear time algorithm for disjoint paths in graphs with bounded tree width by Petra Scheffler |
| title_fullStr | A practical linear time algorithm for disjoint paths in graphs with bounded tree width by Petra Scheffler |
| title_full_unstemmed | A practical linear time algorithm for disjoint paths in graphs with bounded tree width by Petra Scheffler |
| title_short | A practical linear time algorithm for disjoint paths in graphs with bounded tree width |
| title_sort | a practical linear time algorithm for disjoint paths in graphs with bounded tree width |
| volume_link | (DE-604)BV009130191 |
| work_keys_str_mv | AT schefflerpetra apracticallineartimealgorithmfordisjointpathsingraphswithboundedtreewidth |