Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.
Michael S. JacobsonAndré E. KézdyJenö LehelPublished in: Networks (1998)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- satisfiability problem
- graph matching
- np hard
- shortest path
- computational complexity
- constraint satisfaction problems
- graph mining
- pspace complete
- subgraph isomorphism
- graph model
- np complete problems
- data complexity
- graph theoretic
- weighted graph
- graph databases
- graph clustering
- conjunctive queries
- database
- complex structures
- bipartite graph
- graph kernels
- phase transition
- objective function
- directed graph
- strongly connected
- neural network