A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs.
Michael J. DinneenMasoud KhosravaniPublished in: SIROCCO (2010)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- relational learning
- conjunctive queries
- boolean functions
- highly parallelizable
- np hard
- dynamic programming
- spanning tree
- tractable cases
- information extraction
- domain knowledge
- data mining
- graph theoretic
- data complexity
- databases
- fixed parameter tractable
- bounded degree
- database