Deciding whether a planar graph has a cubic subgraph is NP-complete:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Newcastle upon Tyne
1991
|
| Schriftenreihe: | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series
332 |
| Schlagwörter: | |
| Umfang: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993389 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1991 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)60002930 | ||
| 035 | |a (DE-599)BVBBV008993389 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Stewart, Iain A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Deciding whether a planar graph has a cubic subgraph is NP-complete |c I. A. Stewart |
| 264 | 1 | |a Newcastle upon Tyne |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |v 332 | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Mathematics | |
| 830 | 0 | |a Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |v 332 |w (DE-604)BV008912269 |9 332 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005942168 | |
Datensatz im Suchindex
| _version_ | 1818951162335854592 |
|---|---|
| any_adam_object | |
| author | Stewart, Iain A. |
| author_facet | Stewart, Iain A. |
| author_role | aut |
| author_sort | Stewart, Iain A. |
| author_variant | i a s ia ias |
| building | Verbundindex |
| bvnumber | BV008993389 |
| ctrlnum | (OCoLC)60002930 (DE-599)BVBBV008993389 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01041nam a2200325 cb4500</leader><controlfield tag="001">BV008993389</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1991 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60002930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993389</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stewart, Iain A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Deciding whether a planar graph has a cubic subgraph is NP-complete</subfield><subfield code="c">I. A. Stewart</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Newcastle upon Tyne</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</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">Computing Laboratory <Newcastle-upon-Tyne>: Technical report series</subfield><subfield code="v">332</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computing Laboratory <Newcastle-upon-Tyne>: Technical report series</subfield><subfield code="v">332</subfield><subfield code="w">(DE-604)BV008912269</subfield><subfield code="9">332</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942168</subfield></datafield></record></collection> |
| id | DE-604.BV008993389 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942168 |
| oclc_num | 60002930 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| series2 | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| spelling | Stewart, Iain A. Verfasser aut Deciding whether a planar graph has a cubic subgraph is NP-complete I. A. Stewart Newcastle upon Tyne 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 332 Computer software sigle Mathematics sigle Mathematik Computer software Mathematics Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 332 (DE-604)BV008912269 332 |
| spellingShingle | Stewart, Iain A. Deciding whether a planar graph has a cubic subgraph is NP-complete Computing Laboratory <Newcastle-upon-Tyne>: Technical report series Computer software sigle Mathematics sigle Mathematik Computer software Mathematics |
| title | Deciding whether a planar graph has a cubic subgraph is NP-complete |
| title_auth | Deciding whether a planar graph has a cubic subgraph is NP-complete |
| title_exact_search | Deciding whether a planar graph has a cubic subgraph is NP-complete |
| title_full | Deciding whether a planar graph has a cubic subgraph is NP-complete I. A. Stewart |
| title_fullStr | Deciding whether a planar graph has a cubic subgraph is NP-complete I. A. Stewart |
| title_full_unstemmed | Deciding whether a planar graph has a cubic subgraph is NP-complete I. A. Stewart |
| title_short | Deciding whether a planar graph has a cubic subgraph is NP-complete |
| title_sort | deciding whether a planar graph has a cubic subgraph is np complete |
| topic | Computer software sigle Mathematics sigle Mathematik Computer software Mathematics |
| topic_facet | Computer software Mathematics Mathematik |
| volume_link | (DE-604)BV008912269 |
| work_keys_str_mv | AT stewartiaina decidingwhetheraplanargraphhasacubicsubgraphisnpcomplete |