On the complexity of vertex disjoint length restricted path problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
ZIB
1998
|
| Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1998,20 |
| Beschreibung: | 17 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012484034 | ||
| 003 | DE-604 | ||
| 005 | 20031112 | ||
| 007 | t | ||
| 008 | 990323s1998 gw d||| ||||z00||| eng d | ||
| 016 | 7 | |a 955923298 |2 DE-101 | |
| 035 | |a (OCoLC)76017620 | ||
| 035 | |a (DE-599)BVBBV012484034 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-703 |a DE-188 | ||
| 084 | |a SS 4777 |0 (DE-625)143522: |2 rvk | ||
| 100 | 1 | |a Bley, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the complexity of vertex disjoint length restricted path problems |c Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB |
| 264 | 1 | |a Berlin |b ZIB |c 1998 | |
| 300 | |a 17 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |v 1998,20 | |
| 810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1998,20 |w (DE-604)BV004801715 |9 1998,20 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008473446 | ||
Datensatz im Suchindex
| _version_ | 1804127126331326464 |
|---|---|
| any_adam_object | |
| author | Bley, Andreas |
| author_facet | Bley, Andreas |
| author_role | aut |
| author_sort | Bley, Andreas |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV012484034 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)76017620 (DE-599)BVBBV012484034 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01054nam a2200301 cb4500</leader><controlfield tag="001">BV012484034</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031112 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">990323s1998 gw d||| ||||z00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">955923298</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76017620</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012484034</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4777</subfield><subfield code="0">(DE-625)143522:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bley, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of vertex disjoint length restricted path problems</subfield><subfield code="c">Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">ZIB</subfield><subfield code="c">1998</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="490" ind1="1" ind2=" "><subfield code="a">Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="v">1998,20</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1998,20</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1998,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008473446</subfield></datafield></record></collection> |
| id | DE-604.BV012484034 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:28:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008473446 |
| oclc_num | 76017620 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 17 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | ZIB |
| record_format | marc |
| series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
| spelling | Bley, Andreas Verfasser aut On the complexity of vertex disjoint length restricted path problems Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB Berlin ZIB 1998 17 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1998,20 Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1998,20 (DE-604)BV004801715 1998,20 |
| spellingShingle | Bley, Andreas On the complexity of vertex disjoint length restricted path problems |
| title | On the complexity of vertex disjoint length restricted path problems |
| title_auth | On the complexity of vertex disjoint length restricted path problems |
| title_exact_search | On the complexity of vertex disjoint length restricted path problems |
| title_full | On the complexity of vertex disjoint length restricted path problems Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB |
| title_fullStr | On the complexity of vertex disjoint length restricted path problems Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB |
| title_full_unstemmed | On the complexity of vertex disjoint length restricted path problems Andreas Bley. Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB |
| title_short | On the complexity of vertex disjoint length restricted path problems |
| title_sort | on the complexity of vertex disjoint length restricted path problems |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT bleyandreas onthecomplexityofvertexdisjointlengthrestrictedpathproblems |