Polynomial time approximation schemes for clustering in low highway dimension graphs.
Andreas Emil FeldmannDavid SaulpicPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- approximation schemes
- approximation algorithms
- graph theoretic
- graph clustering
- clustering method
- clustering algorithm
- special case
- k means
- graph partitioning
- graph isomorphism
- high dimension
- spectral clustering
- planar graphs
- np hard
- data clustering
- computational complexity
- graph model
- graph theory
- graph construction
- graph matching
- bipartite graph
- polynomial time complexity