On the Computational Complexity of Degenerate Unit Distance Representations of Graphs.
Boris HorvatJan KratochvílTomaz PisanskiPublished in: IWOCA (2010)
Keyphrases
- computational complexity
- graph representations
- distance measure
- np complete
- distance function
- euclidean distance
- computational cost
- graph theoretic
- low complexity
- distance transform
- string edit distance
- symbolic representation
- complex structures
- graph matching
- directed graph
- special case
- bit rate
- data sets
- high computational complexity
- graph clustering
- processing units
- worst case
- higher level
- graph partitioning
- undirected graph
- graph databases
- graph mining
- graph structure
- graph theory
- computationally efficient
- computational efficiency