On computational complexity of length embeddability of graphs.
Mikhail TikhomirovPublished in: Discret. Math. (2016)
Keyphrases
- computational complexity
- graph structures
- np complete
- weighted graph
- graph matching
- graph theoretic
- graph representation
- rate distortion
- graph mining
- decision problems
- graph theory
- memory requirements
- series parallel
- fixed length
- low complexity
- directed graph
- computational efficiency
- learning algorithm
- sample size
- worst case
- np hard
- random graphs
- high computational complexity
- special case
- pairwise
- total length