Dynamic programming on graphs with bounded treewidth:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1987
|
| Schlagworte: | |
| Beschreibung: | 66 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021891653 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 900706s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)18430467 | ||
| 035 | |a (DE-599)BVBBV021891653 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT/LCS/TR-394 | ||
| 100 | 1 | |a Bodlaender, Hans L. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Dynamic programming on graphs with bounded treewidth |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1987 | |
| 300 | |a 66 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Dynamic programming | |
| 650 | 4 | |a Graph theory |x Data processing | |
| 650 | 4 | |a Trees (Graph theory) | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015106852 | ||
Datensatz im Suchindex
| _version_ | 1804135835062239232 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bodlaender, Hans L. |
| author_facet | Bodlaender, Hans L. |
| author_role | aut |
| author_sort | Bodlaender, Hans L. |
| author_variant | h l b hl hlb |
| building | Verbundindex |
| bvnumber | BV021891653 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)18430467 (DE-599)BVBBV021891653 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01439nam a2200457zc 4500</leader><controlfield tag="001">BV021891653</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900706s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18430467</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021891653</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-394</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bodlaender, Hans L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic programming on graphs with bounded treewidth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">66 Bl.</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="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="x">Data processing</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015106852</subfield></datafield></record></collection> |
| id | DE-604.BV021891653 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:11Z |
| indexdate | 2024-07-09T20:46:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015106852 |
| oclc_num | 18430467 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 66 Bl. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Bodlaender, Hans L. Verfasser aut Dynamic programming on graphs with bounded treewidth Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1987 66 Bl. txt rdacontent n rdamedia nc rdacarrier Datenverarbeitung Dynamic programming Graph theory Data processing Trees (Graph theory) Komplexität (DE-588)4135369-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Graph (DE-588)4021842-9 s Programmierung (DE-588)4076370-5 s Komplexität (DE-588)4135369-9 s |
| spellingShingle | Bodlaender, Hans L. Dynamic programming on graphs with bounded treewidth Datenverarbeitung Dynamic programming Graph theory Data processing Trees (Graph theory) Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4001183-5 (DE-588)4076370-5 (DE-588)4021842-9 |
| title | Dynamic programming on graphs with bounded treewidth |
| title_auth | Dynamic programming on graphs with bounded treewidth |
| title_exact_search | Dynamic programming on graphs with bounded treewidth |
| title_exact_search_txtP | Dynamic programming on graphs with bounded treewidth |
| title_full | Dynamic programming on graphs with bounded treewidth |
| title_fullStr | Dynamic programming on graphs with bounded treewidth |
| title_full_unstemmed | Dynamic programming on graphs with bounded treewidth |
| title_short | Dynamic programming on graphs with bounded treewidth |
| title_sort | dynamic programming on graphs with bounded treewidth |
| topic | Datenverarbeitung Dynamic programming Graph theory Data processing Trees (Graph theory) Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Datenverarbeitung Dynamic programming Graph theory Data processing Trees (Graph theory) Komplexität Algorithmus Programmierung Graph |
| work_keys_str_mv | AT bodlaenderhansl dynamicprogrammingongraphswithboundedtreewidth |