Minimal acyclic forbidden minors for the family of graphs with bounded path-width.
Atsushi TakahashiShuichi UenoYoji KajitaniPublished in: Discret. Math. (1994)
Keyphrases
- bounded treewidth
- np complete
- connected graphs
- np hard
- shortest path
- strongly connected
- graph theoretic
- graph matching
- special case
- graph mining
- weighted graph
- graph model
- graph theory
- graph partitioning
- graph representation
- query answering
- directed graph
- database schemes
- decision problems
- neural network
- markov equivalence classes
- conjunctive queries
- edge weights
- series parallel
- hypertree decomposition