A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Hajo BroersmaElias DahlhausTon KloksPublished in: Discret. Appl. Math. (2000)
Keyphrases
- bounded treewidth
- maximum distance
- upper bound
- search space
- spanning tree
- np complete
- minimum distance
- graph theoretic
- space complexity
- graph structure
- constraint graph
- distance metric
- distance measure
- boolean functions
- similarity measure
- weighted graph
- minimum cost
- euclidean distance
- data points
- graph matching
- hamming distance
- distance function
- neighborhood graph
- shortest path
- tree decompositions