Treewidth: Characterizations, Applications, and Computations
This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterization...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 14 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Bodlaender, Hans L. |
| description | This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested. |
| doi_str_mv | 10.1007/11917496_1 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19183374</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19183374</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-43e3d5018f2c59aecdf3b9c003782038d892070fb6de0e5dc288738cdbd542683</originalsourceid><addsrcrecordid>eNpVkE1LxDAQhuMXuKx78RfsRfBgdSaTNol4WYpfsOBlPYc0Sd3q2pakIvrrrawizmWYeV-Gdx7GjhHOEUBeIGqUQhcGd9hMS0W5AKFIcdplEywQMyKh9_5pWOyzCRDwTEtBh2yW0jOMRSi1xgm7WsUQ3hs_rC_n5dpG64YQm087NF2bzuaLvt807neyrZ-X3Wv_Nmw3R-ygtpsUZj99yh5vrlflXbZ8uL0vF8vMEc-HTFAgnwOqmrtc2-B8TZV2YwipOJDySnOQUFeFDxBy77hSkpTzlc8FLxRN2cn2bm-Ts5s62tY1yfSxebXxw4xYFNH43pSdbn1plNqnEE3VdS_JIJhvgOYPIH0BRDRcIQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Treewidth: Characterizations, Applications, and Computations</title><source>Springer Books</source><creator>Bodlaender, Hans L.</creator><contributor>Fomin, Fedor V.</contributor><creatorcontrib>Bodlaender, Hans L. ; Fomin, Fedor V.</creatorcontrib><description>This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540483816</identifier><identifier>ISBN: 3540483810</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540483823</identifier><identifier>EISBN: 3540483829</identifier><identifier>DOI: 10.1007/11917496_1</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmic Aspect ; Applied sciences ; Chordal Graph ; Computer science; control theory; systems ; Exact sciences and technology ; Information retrieval. Graph ; Input Graph ; Linear Time Algorithm ; Theoretical computing ; Tree Decomposition</subject><ispartof>Graph-Theoretic Concepts in Computer Science, 2006, p.1-14</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-43e3d5018f2c59aecdf3b9c003782038d892070fb6de0e5dc288738cdbd542683</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11917496_1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11917496_1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19183374$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Fomin, Fedor V.</contributor><creatorcontrib>Bodlaender, Hans L.</creatorcontrib><title>Treewidth: Characterizations, Applications, and Computations</title><title>Graph-Theoretic Concepts in Computer Science</title><description>This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.</description><subject>Algorithmic Aspect</subject><subject>Applied sciences</subject><subject>Chordal Graph</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Input Graph</subject><subject>Linear Time Algorithm</subject><subject>Theoretical computing</subject><subject>Tree Decomposition</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540483816</isbn><isbn>3540483810</isbn><isbn>9783540483823</isbn><isbn>3540483829</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpVkE1LxDAQhuMXuKx78RfsRfBgdSaTNol4WYpfsOBlPYc0Sd3q2pakIvrrrawizmWYeV-Gdx7GjhHOEUBeIGqUQhcGd9hMS0W5AKFIcdplEywQMyKh9_5pWOyzCRDwTEtBh2yW0jOMRSi1xgm7WsUQ3hs_rC_n5dpG64YQm087NF2bzuaLvt807neyrZ-X3Wv_Nmw3R-ygtpsUZj99yh5vrlflXbZ8uL0vF8vMEc-HTFAgnwOqmrtc2-B8TZV2YwipOJDySnOQUFeFDxBy77hSkpTzlc8FLxRN2cn2bm-Ts5s62tY1yfSxebXxw4xYFNH43pSdbn1plNqnEE3VdS_JIJhvgOYPIH0BRDRcIQ</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Bodlaender, Hans L.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Treewidth: Characterizations, Applications, and Computations</title><author>Bodlaender, Hans L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-43e3d5018f2c59aecdf3b9c003782038d892070fb6de0e5dc288738cdbd542683</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmic Aspect</topic><topic>Applied sciences</topic><topic>Chordal Graph</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Input Graph</topic><topic>Linear Time Algorithm</topic><topic>Theoretical computing</topic><topic>Tree Decomposition</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bodlaender, Hans L.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bodlaender, Hans L.</au><au>Fomin, Fedor V.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Treewidth: Characterizations, Applications, and Computations</atitle><btitle>Graph-Theoretic Concepts in Computer Science</btitle><date>2006</date><risdate>2006</risdate><spage>1</spage><epage>14</epage><pages>1-14</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540483816</isbn><isbn>3540483810</isbn><eisbn>9783540483823</eisbn><eisbn>3540483829</eisbn><abstract>This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11917496_1</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Graph-Theoretic Concepts in Computer Science, 2006, p.1-14 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19183374 |
| source | Springer Books |
| subjects | Algorithmic Aspect Applied sciences Chordal Graph Computer science control theory systems Exact sciences and technology Information retrieval. Graph Input Graph Linear Time Algorithm Theoretical computing Tree Decomposition |
| title | Treewidth: Characterizations, Applications, and Computations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T08%3A07%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Treewidth:%20Characterizations,%20Applications,%20and%20Computations&rft.btitle=Graph-Theoretic%20Concepts%20in%20Computer%20Science&rft.au=Bodlaender,%20Hans%20L.&rft.date=2006&rft.spage=1&rft.epage=14&rft.pages=1-14&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540483816&rft.isbn_list=3540483810&rft_id=info:doi/10.1007/11917496_1&rft_dat=%3Cpascalfrancis_sprin%3E19183374%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540483823&rft.eisbn_list=3540483829&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |