graphs-8
Tree Decomposition
3260 papers • 126 benchmarks • 313 datasets
Tree Decomposition is a technique in graph theory and computer science for representing a graph as a tree, where each node in the tree represents a set of vertices in the original graph. The goal of tree decomposition is to divide the graph into smaller, more manageable pieces, and to use the tree to represent the relationships between these pieces.
(Image credit: Papersgraph)
Benchmarks
These leaderboards are used to track progress in tree-decomposition-8
Trend
Dataset
Best Model
Actions
No benchmarks available.
Libraries
iUse these libraries to find tree-decomposition-8 models and implementations
Datasets
No datasets available.
Subtasks
No subtasks available.
Most implemented papers
Constraint-based Causal Structure Learning with Consistent Separating Sets
Honghao Li, Vincent Cabeli, Nadir Sella, H. Isambert•Mon Dec 31 2018
A simple modi-cation of PC and PC-derived algorithms is proposed so as to ensure that all separating sets identified to remove dispensable edges are consistent with the final graph, enhancing the explainability of constraint-based methods.
25