
Summary: A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree- decompositions to solve hard problems efficiently, graph minor theory, and some applications. The paper contains an extensive bibliography.
pathwidth, bibliography, graph minor, Landbouwwetenschappen, Informatica, tree-decompositions, Natuurwetenschappen, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), treewidth, Wiskunde en Informatica (WIIN), Bibliographies for mathematics in general, algorithmic graph theory, Wiskunde en Informatica, Mathematics
pathwidth, bibliography, graph minor, Landbouwwetenschappen, Informatica, tree-decompositions, Natuurwetenschappen, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), treewidth, Wiskunde en Informatica (WIIN), Bibliographies for mathematics in general, algorithmic graph theory, Wiskunde en Informatica, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
