ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs (2002)

by Yehuda Koren , Liran Carmel , David Harel
Citations:64 - 13 self

Active Bibliography

30 Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation – Yehuda Koren, Liran Carmel, David Harel - 2003
15 Drawing graphs by eigenvectors: Theory and practice – Yehuda Koren - 2005
Graph Drawing by Subspace Optimization – O. Deussen, C. Hansen, D. A. Keim, D. Saupe (editors, Yehuda Koren
636 Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules – A. Jadbabaie, J. Lin, A. S. Morse - 2002
803 A fast and high quality multilevel scheme for partitioning irregular graphs – George Karypis, Vipin Kumar - 1998
555 Efficient Graph-Based Image Segmentation – Pedro F. Felzenszwalb, Daniel P. Huttenlocher
755 Laplacian Eigenmaps for Dimensionality Reduction and Data Representation – Mikhail Belkin, Partha Niyogi - 2003
515 Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions – Xiaojin Zhu , Zoubin Ghahramani, John Lafferty - 2003
679 Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images – Yuri Y. Boykov, et al. - 2001