Linear-time algorithms for NP-complete problems restricted to partial k-trees:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English Russian German |
| Veröffentlicht: |
Berlin
1987
|
| Schriftenreihe: | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report
87,3 |
| Schlagworte: | |
| Beschreibung: | 48 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009226619 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)18950614 | ||
| 035 | |a (DE-599)BVBBV009226619 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng |a rus |a ger | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511.5 | |
| 084 | |a SI 109 |0 (DE-625)143079: |2 rvk | ||
| 100 | 1 | |a Scheffler, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| 264 | 1 | |a Berlin |c 1987 | |
| 300 | |a 48 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report |v 87,3 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a NP-complete problems | |
| 650 | 4 | |a Trees (Graph theory) | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report |v 87,3 |w (DE-604)BV005631778 |9 87,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006135422 | ||
Datensatz im Suchindex
| _version_ | 1804123669911306240 |
|---|---|
| any_adam_object | |
| author | Scheffler, Peter |
| author_facet | Scheffler, Peter |
| author_role | aut |
| author_sort | Scheffler, Peter |
| author_variant | p s ps |
| building | Verbundindex |
| bvnumber | BV009226619 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SI 109 |
| ctrlnum | (OCoLC)18950614 (DE-599)BVBBV009226619 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01222nam a2200385 cb4500</leader><controlfield tag="001">BV009226619</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18950614</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009226619</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><subfield code="a">rus</subfield><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 109</subfield><subfield code="0">(DE-625)143079:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scheffler, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear-time algorithms for NP-complete problems restricted to partial k-trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">48 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">Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report</subfield><subfield code="v">87,3</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report</subfield><subfield code="v">87,3</subfield><subfield code="w">(DE-604)BV005631778</subfield><subfield code="9">87,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006135422</subfield></datafield></record></collection> |
| id | DE-604.BV009226619 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:27Z |
| institution | BVB |
| language | English Russian German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006135422 |
| oclc_num | 18950614 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 48 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report |
| series2 | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report |
| spelling | Scheffler, Peter Verfasser aut Linear-time algorithms for NP-complete problems restricted to partial k-trees Berlin 1987 48 S. txt rdacontent n rdamedia nc rdacarrier Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report 87,3 Algorithms Graph theory NP-complete problems Trees (Graph theory) Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report 87,3 (DE-604)BV005631778 87,3 |
| spellingShingle | Scheffler, Peter Linear-time algorithms for NP-complete problems restricted to partial k-trees Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Report Algorithms Graph theory NP-complete problems Trees (Graph theory) Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 |
| title | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_auth | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_exact_search | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_full | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_fullStr | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_full_unstemmed | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_short | Linear-time algorithms for NP-complete problems restricted to partial k-trees |
| title_sort | linear time algorithms for np complete problems restricted to partial k trees |
| topic | Algorithms Graph theory NP-complete problems Trees (Graph theory) Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Algorithms Graph theory NP-complete problems Trees (Graph theory) Graphentheorie |
| volume_link | (DE-604)BV005631778 |
| work_keys_str_mv | AT schefflerpeter lineartimealgorithmsfornpcompleteproblemsrestrictedtopartialktrees |