EM-FGS: Graph sparsification via faster semi-metric edges pruning
- 3 May 2019
- journal article
- research article
- Published by Springer Science and Business Media LLC in Applied Intelligence
- Vol. 49 (10), 3731-3748
- https://doi.org/10.1007/s10489-019-01479-4
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Science and Technology (2018R1A2A2A05023669)
This publication has 38 references indexed in Scilit:
- Spectral sparsification of graphsCommunications of the ACM, 2013
- Spectral Sparsification of GraphsSIAM Journal on Computing, 2011
- Graph Sparsification by Effective ResistancesSIAM Journal on Computing, 2011
- A Survey of Clustering Algorithms for Graph DataPublished by Springer Science and Business Media LLC ,2010
- Towards a theoretical foundation for Laplacian-based manifold methodsJournal of Computer and System Sciences, 2008
- Benchmark graphs for testing community detection algorithmsPhysical Review E, 2008
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphsRandom Structures & Algorithms, 2006
- On Dynamic Shortest Paths ProblemsLecture Notes in Computer Science, 2004
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Graph spannersJournal of Graph Theory, 1989