On the computational complexity of partial covers of Theta graphs.
Jirí FialaJan KratochvílAttila PórPublished in: Electron. Notes Discret. Math. (2005)
Keyphrases
- computational complexity
- worst case
- special case
- graph matching
- np complete
- high computational complexity
- graph theory
- neural network
- graph clustering
- bipartite graph
- graph theoretic
- directed graph
- graph model
- computational efficiency
- data mining
- low complexity
- graph mining
- np hard
- book covers
- graph databases
- partial information
- series parallel
- computationally efficient
- bit rate
- motion estimation
- computational cost
- optimal solution
- bayesian networks
- case study
- knowledge base
- learning algorithm