On computational complexity of length embeddability of graphs.
Mikhail TikhomirovPublished in: CoRR (2014)
Keyphrases
- computational complexity
- special case
- np hard
- weighted graph
- graph theoretic
- graph theory
- directed graph
- computationally efficient
- np complete
- graph clustering
- computational cost
- graph matching
- memory requirements
- decision problems
- series parallel
- social networks
- graph mining
- graph databases
- storage requirements
- random graphs
- fixed length
- graph construction
- graph kernels
- high computational complexity
- total length
- lower bound
- graph representation
- maximum number
- spanning tree
- computational efficiency
- rate distortion