Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time.
Henning BruhnOliver SchaudtPublished in: SIAM J. Discret. Math. (2016)
Keyphrases
- graph isomorphism
- bounded treewidth
- special case
- polynomial time complexity
- graph databases
- graph theoretic
- graph theory
- graph representation
- structured objects
- graph matching
- pattern recognition
- approximation algorithms
- database
- random graphs
- graph mining
- directed graph
- graph structures
- lower bound
- worst case
- planar graphs
- series parallel
- subgraph isomorphism
- np hardness
- graph search
- graph kernels
- graph partitioning
- graph model