Degree based treewidth lower bounds:
Abstract: "Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationtechnik
2004
|
| Schriftenreihe: | ZIB
2004,44 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they are all the vertex-degree of some vertex in a subgraph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds." |
| Beschreibung: | 18 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV019643140 | ||
| 003 | DE-604 | ||
| 005 | 20060111 | ||
| 007 | t | ||
| 008 | 041223s2004 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)60248895 | ||
| 035 | |a (DE-599)BVBBV019643140 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-188 | ||
| 084 | |a SS 4779 |0 (DE-625)143524: |2 rvk | ||
| 100 | 1 | |a Koster, Arie M. C. A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Degree based treewidth lower bounds |c Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender |
| 246 | 1 | 3 | |a Degree-based treewidth lower bounds |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationtechnik |c 2004 | |
| 300 | |a 18 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIB |v 2004,44 | |
| 520 | 3 | |a Abstract: "Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they are all the vertex-degree of some vertex in a subgraph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Wolle, Thomas |e Verfasser |4 aut | |
| 700 | 1 | |a Bodlaender, Hans L. |e Verfasser |4 aut | |
| 830 | 0 | |a ZIB |v 2004,44 |w (DE-604)BV013191727 |9 2004,44 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012971973 | ||
Datensatz im Suchindex
| _version_ | 1804133015724490752 |
|---|---|
| any_adam_object | |
| author | Koster, Arie M. C. A. Wolle, Thomas Bodlaender, Hans L. |
| author_facet | Koster, Arie M. C. A. Wolle, Thomas Bodlaender, Hans L. |
| author_role | aut aut aut |
| author_sort | Koster, Arie M. C. A. |
| author_variant | a m c a k amca amcak t w tw h l b hl hlb |
| building | Verbundindex |
| bvnumber | BV019643140 |
| classification_rvk | SS 4779 |
| ctrlnum | (OCoLC)60248895 (DE-599)BVBBV019643140 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01915nam a2200349 cb4500</leader><controlfield tag="001">BV019643140</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060111 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041223s2004 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60248895</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019643140</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4779</subfield><subfield code="0">(DE-625)143524:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Koster, Arie M. C. A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Degree based treewidth lower bounds</subfield><subfield code="c">Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Degree-based treewidth lower bounds</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationtechnik</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">ZIB</subfield><subfield code="v">2004,44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they are all the vertex-degree of some vertex in a subgraph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wolle, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bodlaender, Hans L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ZIB</subfield><subfield code="v">2004,44</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2004,44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012971973</subfield></datafield></record></collection> |
| id | DE-604.BV019643140 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:02:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012971973 |
| oclc_num | 60248895 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 18 S. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Konrad-Zuse-Zentrum für Informationtechnik |
| record_format | marc |
| series | ZIB |
| series2 | ZIB |
| spelling | Koster, Arie M. C. A. Verfasser aut Degree based treewidth lower bounds Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender Degree-based treewidth lower bounds Berlin Konrad-Zuse-Zentrum für Informationtechnik 2004 18 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier ZIB 2004,44 Abstract: "Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they are all the vertex-degree of some vertex in a subgraph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds." Branch and bound algorithms Trees (Graph theory) Wolle, Thomas Verfasser aut Bodlaender, Hans L. Verfasser aut ZIB 2004,44 (DE-604)BV013191727 2004,44 |
| spellingShingle | Koster, Arie M. C. A. Wolle, Thomas Bodlaender, Hans L. Degree based treewidth lower bounds ZIB Branch and bound algorithms Trees (Graph theory) |
| title | Degree based treewidth lower bounds |
| title_alt | Degree-based treewidth lower bounds |
| title_auth | Degree based treewidth lower bounds |
| title_exact_search | Degree based treewidth lower bounds |
| title_full | Degree based treewidth lower bounds Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender |
| title_fullStr | Degree based treewidth lower bounds Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender |
| title_full_unstemmed | Degree based treewidth lower bounds Arie M. C. A. Koster ; Thomas Wolle ; Hans L. Bodlaender |
| title_short | Degree based treewidth lower bounds |
| title_sort | degree based treewidth lower bounds |
| topic | Branch and bound algorithms Trees (Graph theory) |
| topic_facet | Branch and bound algorithms Trees (Graph theory) |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT kosterariemca degreebasedtreewidthlowerbounds AT wollethomas degreebasedtreewidthlowerbounds AT bodlaenderhansl degreebasedtreewidthlowerbounds |