Live briefing
Everything about Tree decomposition
Mapping of a graph into a tree
In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Tree decompositionA 5-minute orientation
- Skim a recent paper: Approximate convex decomposition for 3D meshes with collision-aware concavity and tree searchInfluential work since 2022
- Pick up a classic book: Decomposition of graphs into treesThe most-reprinted book on the subject
- Read the landmark paper: A new energy decomposition scheme for molecular interactions within the Hartree‐Fock approximationCited 2,104 times
- Go sideways: TreewidthA closely related topic
- Go sideways: PathwidthA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A new energy decomposition scheme for molecular interactions within the Hartree‐Fock approximation
Graph minors. X. Obstructions to tree-decomposition
An optimal decomposition algorithm for tree edit distance
Fate of mercury in tree litter during decomposition
DISCO: Species Tree Inference using Multicopy Gene Family Tree Decomposition
Solving partial constraint satisfaction problems with tree decomposition
Studies of the Decomposition Rates of Tree Litter
Some results on tree decomposition of graphs
🆕 Influential since 2022
Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search
Enhancing vulnerability detection via AST decomposition and neural sub-tree encoding
A trait-based root acquisition-defence-decomposition framework in angiosperm tree species
Multi-focus image fusion based on quad-tree decomposition and edge-weighted focus measure
Tree diversity effects on litter decomposition are mediated by litterfall and microbial processes
📚 Books worth reading
- 📕Decomposition of graphs into treesShmuel Zaks · 1977
Decomposition of graphs into treesShmuel Zaks · 1977
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Treewidth In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest…
- Pathwidth In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number…
- Partial k-tree In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatoria…
- Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not…
- Branch-decomposition In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree…
- Courcelle's theorem In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Agreement forest In the mathematical field of graph theory, an agreement forest for two given (leaf-labeled, irreductible) trees is any (leaf-labeled, irreductible) forest…