Name
Abstract | ||
|---|---|---|
With shortest-path distances as input, classical multidimensional scaling can be regarded as a spectral graph drawing algorithm, and recent approximation techniques make it scale to very large graphs. In comparison with other methods, however, it is considered inflexible and prone to degenerate layouts for some classes of graphs. We want to challenge this belief by demonstrating that the method can be flexibly adapted to provide focus+context layouts. Moreover, we propose an alternative instantiation that appears to be more suitable for graph drawing and prevents certain degeneracies. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-36763-2_6 | Graph Drawing |
Keywords | Field | DocType |
classical multidimensional scaling,certain degeneracy,shortest-path distance,recent approximation technique,spectral graph,context layout,graph drawing,new perspective,alternative instantiation,large graph | Graph drawing,Modular decomposition,Forbidden graph characterization,Multidimensional scaling,Computer science,Force-directed graph drawing,Theoretical computer science,Book embedding,Discrete mathematics,Combinatorics,Algorithm,Lattice graph,Planar graph | Conference |
Citations | PageRank | References |
6 | 0.45 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mirza Klimenta | 1 | 13 | 0.91 |
| Ulrik Brandes | 2 | 2308 | 181.69 |