A faster algorithm for edge-disjoint paths in planar graphs:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Saarbrücken
Max-Planck-Inst. f. Informatik
1991
|
| Beschreibung: | 17 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV005923545 | ||
| 003 | DE-604 | ||
| 005 | 20210416 | ||
| 007 | t | ||
| 008 | 930114s1991 d||| |||| 00||| gerod | ||
| 035 | |a (OCoLC)256191063 | ||
| 035 | |a (DE-599)BVBBV005923545 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-91 | ||
| 100 | 1 | |a Kaufmann, Michael |e Verfasser |0 (DE-588)1211616053 |4 aut | |
| 245 | 1 | 0 | |a A faster algorithm for edge-disjoint paths in planar graphs |c Michael Kaufmann ; Gerhard Klar |
| 246 | 1 | 3 | |a SFB 124 TP B2 1/91 |
| 264 | 1 | |a Saarbrücken |b Max-Planck-Inst. f. Informatik |c 1991 | |
| 300 | |a 17 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 700 | 1 | |a Klar, Gerhard |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003709276 | ||
Datensatz im Suchindex
| _version_ | 1804120114312773632 |
|---|---|
| any_adam_object | |
| author | Kaufmann, Michael Klar, Gerhard |
| author_GND | (DE-588)1211616053 |
| author_facet | Kaufmann, Michael Klar, Gerhard |
| author_role | aut aut |
| author_sort | Kaufmann, Michael |
| author_variant | m k mk g k gk |
| building | Verbundindex |
| bvnumber | BV005923545 |
| ctrlnum | (OCoLC)256191063 (DE-599)BVBBV005923545 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00827nam a2200265 c 4500</leader><controlfield tag="001">BV005923545</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930114s1991 d||| |||| 00||| gerod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)256191063</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005923545</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-91</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kaufmann, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1211616053</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A faster algorithm for edge-disjoint paths in planar graphs</subfield><subfield code="c">Michael Kaufmann ; Gerhard Klar</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">SFB 124 TP B2 1/91</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken</subfield><subfield code="b">Max-Planck-Inst. f. Informatik</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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="700" ind1="1" ind2=" "><subfield code="a">Klar, Gerhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003709276</subfield></datafield></record></collection> |
| id | DE-604.BV005923545 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:36:56Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003709276 |
| oclc_num | 256191063 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 17 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Max-Planck-Inst. f. Informatik |
| record_format | marc |
| spelling | Kaufmann, Michael Verfasser (DE-588)1211616053 aut A faster algorithm for edge-disjoint paths in planar graphs Michael Kaufmann ; Gerhard Klar SFB 124 TP B2 1/91 Saarbrücken Max-Planck-Inst. f. Informatik 1991 17 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Klar, Gerhard Verfasser aut |
| spellingShingle | Kaufmann, Michael Klar, Gerhard A faster algorithm for edge-disjoint paths in planar graphs |
| title | A faster algorithm for edge-disjoint paths in planar graphs |
| title_alt | SFB 124 TP B2 1/91 |
| title_auth | A faster algorithm for edge-disjoint paths in planar graphs |
| title_exact_search | A faster algorithm for edge-disjoint paths in planar graphs |
| title_full | A faster algorithm for edge-disjoint paths in planar graphs Michael Kaufmann ; Gerhard Klar |
| title_fullStr | A faster algorithm for edge-disjoint paths in planar graphs Michael Kaufmann ; Gerhard Klar |
| title_full_unstemmed | A faster algorithm for edge-disjoint paths in planar graphs Michael Kaufmann ; Gerhard Klar |
| title_short | A faster algorithm for edge-disjoint paths in planar graphs |
| title_sort | a faster algorithm for edge disjoint paths in planar graphs |
| work_keys_str_mv | AT kaufmannmichael afasteralgorithmforedgedisjointpathsinplanargraphs AT klargerhard afasteralgorithmforedgedisjointpathsinplanargraphs AT kaufmannmichael sfb124tpb2191 AT klargerhard sfb124tpb2191 |