On the computational complexity of partial covers of Theta graphs.
Jirí FialaJan KratochvílAttila PórPublished in: Discret. Appl. Math. (2008)
Keyphrases
- computational complexity
- np complete
- worst case
- graph theoretic
- special case
- computationally efficient
- np hard
- graph model
- high computational complexity
- graph mining
- case study
- book covers
- graph databases
- graph theory
- graph matching
- memory requirements
- search algorithm
- data sets
- graph structure
- decision problems
- rate distortion
- storage requirements
- graph representation
- pattern recognition
- graph clustering
- graph structures