515 search results - page 12 / 103 » Layouts of Expander Graphs |
92
Voted
ENDM
2010
15 years 25 days ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
75
Voted
ICSE
2003
IEEE-ACM
16 years 25 days ago
2003
IEEE-ACM
Editing graphic models always entails layout problems. Inserting and deleting items requires tedious manual work for shifting existing items and rearranging the diagram layout. He...
100
click to vote
JGAA
2007
15 years 19 days ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
91
Voted
GD
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
182
Voted
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...