Computational complexity of guarding of proximity graphs.
Konstantin KobylkinPublished in: CoRR (2016)
Keyphrases
- computational complexity
- np complete
- graph theory
- computational cost
- graph matching
- graph representation
- high computational complexity
- special case
- computationally efficient
- spanning tree
- graph model
- bipartite graph
- low complexity
- graph theoretic
- decision problems
- np hard
- database
- graph clustering
- graph kernels
- series parallel
- graph mining
- data mining
- storage requirements
- directed graph
- random walk
- random graphs
- pattern recognition
- subgraph isomorphism
- neural network