• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Graph Drawing by High-Dimensional Embedding (2002)

Cached

  • Download as a PDF

Download Links

  • [www.wisdom.weizmann.ac.il]
  • [www.emis.de]
  • [jgaa.info]
  • [www.cs.brown.edu]
  • [www.emis.math.ca]
  • [www.research.att.com]
  • [www.research.att.com]
  • [www.research.att.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by David Harel , Yehuda Koren
Venue:In GD02, LNCS
Citations:47 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Harel02graphdrawing,
    author = {David Harel and Yehuda Koren},
    title = {Graph Drawing by High-Dimensional Embedding},
    booktitle = {In GD02, LNCS},
    year = {2002},
    pages = {207--219},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using PCA. Experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
500 Approximation Algorithms for NP--hard Problems - Hochbaum - 1997
444 A Heuristic for Graph Drawing - Eades - 1984
361 An algorithm for drawing general undirected graph - Kamada, Kawai - 1989
341 Graph Drawing by Forcedirected Placement - Fruchterman, Reingold - 1991
283 Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999
149 Drawing graphs nicely using simulated annealing - Davidson, Harel - 1996
128 Fundamentals of Matrix Computations - Watkins - 1991
79 Reingold E: Graph drawing by force-directed placement - Fruchterman - 1991
74 Applied Multivariate Data Analysis - Brian, Dunn - 2001
69 A multilevel algorithm for force-directed graph drawing - Walshaw - 2002
68 A Fast Multiscale Method for Drawing Large Graphs - Harel, Koren - 2000
56 ACE: a fast multiscale eigenvector computation for huge graphs - Koren, Harel, et al. - 2002
36 D.: Drawing Graphs - Kaufmann, Wagner - 2001
34 A multi-dimensional approach to force-directed layouts of large graphs - Gajer, Goodrich, et al.
26 Fast interactive 3-D graph visualization - BRUss, FRICK - 1997
19 Finding the Best Viewpoints for Three-Dimensional Graph Drawings - Eades, Houle, et al. - 1998
15 Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems - S - 1996
15 A Numerical Optimization Approach to General Graph Drawing - Tunkelang - 1999
12 Robust linear dimensionality reduction - Koren, Carmel
8 A Multi-Scale Method for Drawing Graphs - Hadany, Harel
8 Graph Drawing by Subspace Optimization - Koren - 2004
6 Approximation algorithms for finding best viewpoints - Houle, Webber - 1998
5 A Multi-Scale Method for Drawing Graphs Nicely - Hadany, Harel - 2000
3 On Spectral Graph Drawing”, manuscript - Koren - 2002
3 A Heuristic for Graph Drawing”,Congressus Numerantium 42 - Eades - 1984
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University