Treewidth and Minimum Fill-in of Weakly Triangulated Graphs.
Vincent BouchittéIoan TodincaPublished in: STACS (1999)
Keyphrases
- bounded treewidth
- spanning tree
- graph matching
- reeb graph
- upper bound
- np complete
- constraint graph
- graph mining
- minimum cost
- space complexity
- connected dominating set
- neural network
- graph structure
- graph theory
- np hard
- search space
- graph representation
- graph databases
- decision problems
- complex structures
- graph clustering
- special case
- helmholtz principle
- tree decompositions
- social networks