A note on contraction degeneracy:
Abstract: "The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some re...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
2004
|
| Series: | ZIB-Report
2004,43 |
| Subjects: | |
| Summary: | Abstract: "The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, blocks of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described." |
| Physical Description: | 19 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV019643125 | ||
| 003 | DE-604 | ||
| 005 | 20060111 | ||
| 007 | t| | ||
| 008 | 041223s2004 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)60248899 | ||
| 035 | |a (DE-599)BVBBV019643125 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-188 | ||
| 100 | 1 | |a Wolle, Thomas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A note on contraction degeneracy |c Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 2004 | |
| 300 | |a 19 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIB-Report |v 2004,43 | |
| 520 | 3 | |a Abstract: "The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, blocks of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described." | |
| 650 | 4 | |a Decomposition (Mathematics) | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Koster, Arie M. C. A. |e Verfasser |4 aut | |
| 700 | 1 | |a Bodlaender, Hans L. |e Verfasser |4 aut | |
| 830 | 0 | |a ZIB-Report |v 2004,43 |w (DE-604)BV013191727 |9 2004,43 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-012971958 | |
Record in the Search Index
| _version_ | 1820882437382602752 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Wolle, Thomas Koster, Arie M. C. A. Bodlaender, Hans L. |
| author_facet | Wolle, Thomas Koster, Arie M. C. A. Bodlaender, Hans L. |
| author_role | aut aut aut |
| author_sort | Wolle, Thomas |
| author_variant | t w tw a m c a k amca amcak h l b hl hlb |
| building | Verbundindex |
| bvnumber | BV019643125 |
| classification_rvk | SS 4779 |
| ctrlnum | (OCoLC)60248899 (DE-599)BVBBV019643125 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV019643125</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060111</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">041223s2004 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60248899</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019643125</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="100" ind1="1" ind2=" "><subfield code="a">Wolle, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A note on contraction degeneracy</subfield><subfield code="c">Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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-Report</subfield><subfield code="v">2004,43</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, blocks of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decomposition (Mathematics)</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">Koster, Arie M. C. A.</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-Report</subfield><subfield code="v">2004,43</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2004,43</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012971958</subfield></datafield></record></collection> |
| id | DE-604.BV019643125 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:06:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012971958 |
| oclc_num | 60248899 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 19 S. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | ZIB-Report |
| series2 | ZIB-Report |
| spelling | Wolle, Thomas Verfasser aut A note on contraction degeneracy Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender Berlin Konrad-Zuse-Zentrum für Informationstechnik 2004 19 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier ZIB-Report 2004,43 Abstract: "The parameter contraction degeneracy -- the maximum minimum degree over all minors of a graph -- is a treewidth lower bound and was first defined in [3]. In experiments it was shown that this lower bound improves upon other treewidth lower bounds [3]. In this note, we examine some relationships between the contraction degeneracy and connected components of a graph, blocks of a graph and the genus of a graph. We also look at chordal graphs, and we study an upper bound on the contraction degeneracy. A data structure that can be used for algorithms computing the degeneracy and similar parameters, is also described." Decomposition (Mathematics) Trees (Graph theory) Koster, Arie M. C. A. Verfasser aut Bodlaender, Hans L. Verfasser aut ZIB-Report 2004,43 (DE-604)BV013191727 2004,43 |
| spellingShingle | Wolle, Thomas Koster, Arie M. C. A. Bodlaender, Hans L. A note on contraction degeneracy ZIB-Report Decomposition (Mathematics) Trees (Graph theory) |
| title | A note on contraction degeneracy |
| title_auth | A note on contraction degeneracy |
| title_exact_search | A note on contraction degeneracy |
| title_full | A note on contraction degeneracy Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender |
| title_fullStr | A note on contraction degeneracy Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender |
| title_full_unstemmed | A note on contraction degeneracy Thomas Wolle ; Arie M. C. A. Koster ; Hans L. Bodlaender |
| title_short | A note on contraction degeneracy |
| title_sort | a note on contraction degeneracy |
| topic | Decomposition (Mathematics) Trees (Graph theory) |
| topic_facet | Decomposition (Mathematics) Trees (Graph theory) |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT wollethomas anoteoncontractiondegeneracy AT kosterariemca anoteoncontractiondegeneracy AT bodlaenderhansl anoteoncontractiondegeneracy |