Treewidth and minimum fill-in on permutation graphs in linear time.
Daniel MeisterPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- bounded treewidth
- constraint graph
- graph structure
- search space
- space complexity
- graph matching
- connected dominating set
- connected graphs
- graph mining
- boolean functions
- decision problems
- graph model
- np complete
- spanning tree
- upper bound
- simple polygon
- graph theory
- constraint propagation
- subgraph isomorphism
- tree decompositions
- directed graph
- graph representation
- worst case
- data model
- computational complexity