The graph sandwich problem for 1-join composition is NP-complete.
Celina M. H. de FigueiredoSulamita KleinKristina VuskovicPublished in: Electron. Notes Discret. Math. (2000)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- np hard
- computational complexity
- constraint satisfaction problems
- structured data
- directed graph
- np complete problems
- satisfiability problem
- random walk
- graph theoretic
- connected components
- graph theory
- graph model
- database
- data complexity
- join algorithms
- spanning tree
- directed acyclic graph
- weighted graph
- query optimization
- graph representation
- pspace complete
- bipartite graph
- phase transition
- tree width