NP completeness of some edge disjoint paths problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Bonn
Forschungsinst. für Diskrete Math.
1993
|
| Schriftenreihe: | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report
805 |
| Beschreibung: | 8 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009110854 | ||
| 003 | DE-604 | ||
| 005 | 19940331 | ||
| 007 | t | ||
| 008 | 940228s1993 gw d||| |||| 00||| ger d | ||
| 016 | 7 | |a 94036090X |2 DE-101 | |
| 035 | |a (OCoLC)75492779 | ||
| 035 | |a (DE-599)BVBBV009110854 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Vygen, Jens |d 1967- |e Verfasser |0 (DE-588)14204086X |4 aut | |
| 245 | 1 | 0 | |a NP completeness of some edge disjoint paths problems |c Jens Vygen |
| 246 | 1 | 3 | |a NP-completeness of some edge-disjoint paths problems |
| 264 | 1 | |a Bonn |b Forschungsinst. für Diskrete Math. |c 1993 | |
| 300 | |a 8 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 805 | |
| 830 | 0 | |a Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |v 805 |w (DE-604)BV001337780 |9 805 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006040745 | ||
Datensatz im Suchindex
| _version_ | 1804123526971523072 |
|---|---|
| any_adam_object | |
| author | Vygen, Jens 1967- |
| author_GND | (DE-588)14204086X |
| author_facet | Vygen, Jens 1967- |
| author_role | aut |
| author_sort | Vygen, Jens 1967- |
| author_variant | j v jv |
| building | Verbundindex |
| bvnumber | BV009110854 |
| ctrlnum | (OCoLC)75492779 (DE-599)BVBBV009110854 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01021nam a2200301 cb4500</leader><controlfield tag="001">BV009110854</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940331 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940228s1993 gw d||| |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94036090X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75492779</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009110854</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vygen, Jens</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)14204086X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">NP completeness of some edge disjoint paths problems</subfield><subfield code="c">Jens Vygen</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">NP-completeness of some edge-disjoint paths problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="b">Forschungsinst. für Diskrete Math.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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">805</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Forschungsinstitut für Diskrete Mathematik <Bonn>: Report</subfield><subfield code="v">805</subfield><subfield code="w">(DE-604)BV001337780</subfield><subfield code="9">805</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006040745</subfield></datafield></record></collection> |
| id | DE-604.BV009110854 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:31:11Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006040745 |
| oclc_num | 75492779 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 8 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Forschungsinst. für Diskrete Math. |
| record_format | marc |
| series | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| series2 | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| spelling | Vygen, Jens 1967- Verfasser (DE-588)14204086X aut NP completeness of some edge disjoint paths problems Jens Vygen NP-completeness of some edge-disjoint paths problems Bonn Forschungsinst. für Diskrete Math. 1993 8 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 805 Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 805 (DE-604)BV001337780 805 |
| spellingShingle | Vygen, Jens 1967- NP completeness of some edge disjoint paths problems Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| title | NP completeness of some edge disjoint paths problems |
| title_alt | NP-completeness of some edge-disjoint paths problems |
| title_auth | NP completeness of some edge disjoint paths problems |
| title_exact_search | NP completeness of some edge disjoint paths problems |
| title_full | NP completeness of some edge disjoint paths problems Jens Vygen |
| title_fullStr | NP completeness of some edge disjoint paths problems Jens Vygen |
| title_full_unstemmed | NP completeness of some edge disjoint paths problems Jens Vygen |
| title_short | NP completeness of some edge disjoint paths problems |
| title_sort | np completeness of some edge disjoint paths problems |
| volume_link | (DE-604)BV001337780 |
| work_keys_str_mv | AT vygenjens npcompletenessofsomeedgedisjointpathsproblems |