Graph separation Is N P - hard even for graphs with bounded degree:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Technische Universität
1989
|
| Ausgabe: | Als Manuskript vervielfältigt |
| Schriftenreihe: | Preprint-Reihe Mathematik
215 |
| Beschreibung: | 12 Seiten Diagramme |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV024399904 | ||
| 003 | DE-604 | ||
| 005 | 20210122 | ||
| 007 | t | ||
| 008 | 950425s1989 |||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)916453691 | ||
| 035 | |a (DE-599)BVBBV024399904 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 084 | |a 68E10 |2 msc | ||
| 100 | 1 | |a Wagner, Dorothea |d 1957- |0 (DE-588)11147776X |4 aut | |
| 245 | 1 | 0 | |a Graph separation Is N P - hard even for graphs with bounded degree |c by Dorothea Wagner ; Frank Wagner |
| 250 | |a Als Manuskript vervielfältigt | ||
| 264 | 1 | |a Berlin |b Technische Universität |c 1989 | |
| 300 | |a 12 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 215 | |
| 700 | 1 | |a Wagner, Frank O. |d 1964- |0 (DE-588)173132057 |4 aut | |
| 830 | 0 | |a Preprint-Reihe Mathematik |v 215 |w (DE-604)BV009130191 |9 215 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018378657 | ||
Datensatz im Suchindex
| _version_ | 1804140365080428544 |
|---|---|
| any_adam_object | |
| author | Wagner, Dorothea 1957- Wagner, Frank O. 1964- |
| author_GND | (DE-588)11147776X (DE-588)173132057 |
| author_facet | Wagner, Dorothea 1957- Wagner, Frank O. 1964- |
| author_role | aut aut |
| author_sort | Wagner, Dorothea 1957- |
| author_variant | d w dw f o w fo fow |
| building | Verbundindex |
| bvnumber | BV024399904 |
| ctrlnum | (OCoLC)916453691 (DE-599)BVBBV024399904 |
| 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>00987nam a2200301 cb4500</leader><controlfield tag="001">BV024399904</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210122 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950425s1989 |||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916453691</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024399904</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-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68E10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wagner, Dorothea</subfield><subfield code="d">1957-</subfield><subfield code="0">(DE-588)11147776X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph separation Is N P - hard even for graphs with bounded degree</subfield><subfield code="c">by Dorothea Wagner ; Frank Wagner</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">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">215</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wagner, Frank O.</subfield><subfield code="d">1964-</subfield><subfield code="0">(DE-588)173132057</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Preprint-Reihe Mathematik</subfield><subfield code="v">215</subfield><subfield code="w">(DE-604)BV009130191</subfield><subfield code="9">215</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018378657</subfield></datafield></record></collection> |
| id | DE-604.BV024399904 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:58:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018378657 |
| oclc_num | 916453691 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 12 Seiten Diagramme |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Technische Universität |
| record_format | marc |
| series | Preprint-Reihe Mathematik |
| series2 | Preprint-Reihe Mathematik |
| spelling | Wagner, Dorothea 1957- (DE-588)11147776X aut Graph separation Is N P - hard even for graphs with bounded degree by Dorothea Wagner ; Frank Wagner Als Manuskript vervielfältigt Berlin Technische Universität 1989 12 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Preprint-Reihe Mathematik 215 Wagner, Frank O. 1964- (DE-588)173132057 aut Preprint-Reihe Mathematik 215 (DE-604)BV009130191 215 |
| spellingShingle | Wagner, Dorothea 1957- Wagner, Frank O. 1964- Graph separation Is N P - hard even for graphs with bounded degree Preprint-Reihe Mathematik |
| title | Graph separation Is N P - hard even for graphs with bounded degree |
| title_auth | Graph separation Is N P - hard even for graphs with bounded degree |
| title_exact_search | Graph separation Is N P - hard even for graphs with bounded degree |
| title_full | Graph separation Is N P - hard even for graphs with bounded degree by Dorothea Wagner ; Frank Wagner |
| title_fullStr | Graph separation Is N P - hard even for graphs with bounded degree by Dorothea Wagner ; Frank Wagner |
| title_full_unstemmed | Graph separation Is N P - hard even for graphs with bounded degree by Dorothea Wagner ; Frank Wagner |
| title_short | Graph separation Is N P - hard even for graphs with bounded degree |
| title_sort | graph separation is n p hard even for graphs with bounded degree |
| volume_link | (DE-604)BV009130191 |
| work_keys_str_mv | AT wagnerdorothea graphseparationisnphardevenforgraphswithboundeddegree AT wagnerfranko graphseparationisnphardevenforgraphswithboundeddegree |