The graph sandwich problem for 1-join composition is NP-complete.
Celina M. H. de FigueiredoSulamita KleinKristina VuskovicPublished in: Discret. Appl. Math. (2002)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- computational complexity
- np hard
- graph representation
- satisfiability problem
- constraint satisfaction problems
- conjunctive queries
- graph theory
- structured data
- directed graph
- pspace complete
- query optimization
- phase transition
- graph matching
- connected components
- cartesian product
- np complete problems
- query processing
- database
- graph mining
- data model
- graph structure
- random walk