Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
Daniel A. SpielmanShang-Hua TengPublished in: STOC (2004)
Keyphrases
- graph partitioning
- partitioning algorithm
- linear systems
- min cut
- data clustering
- graph model
- learning algorithm
- weighted graph
- sparse linear systems
- image processing
- feature selection
- normalized cut
- spectral graph partitioning
- global optimization
- sufficient conditions
- image segmentation
- adjacency matrix
- np complete problems
- spectral graph
- social networks