Local Graph Partitions for Approximation and Testing.
Avinatan HassidimJonathan A. KelnerHuy N. NguyenKrzysztof OnakPublished in: FOCS (2009)
Keyphrases
- graph theory
- random walk
- graph representation
- graph structure
- clustering algorithm
- graph partitioning
- dependency graph
- approximation error
- equivalence classes
- weighted graph
- directed graph
- error bounds
- directed acyclic graph
- graph theoretic
- graphical representation
- connected components
- structured data
- vertex set
- data sets
- software testing
- minimum spanning tree
- graph search
- test cases
- graph based algorithm