Sciweavers

369 search results - page 13 / 74
» Layouts of Graph Subdivisions
Sort
View
GD
1997
Springer
14 years 26 days ago
Implementing a General-Purpose Edge Router
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
David P. Dobkin, Emden R. Gansner, Eleftherios Kou...
DM
2006
101views more  DM 2006»
13 years 8 months ago
Cycle double covers and spanning minors II
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
Roland Häggkvist, Klas Markström
IPPS
1999
IEEE
14 years 1 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
GD
2005
Springer
14 years 2 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
Seok-Hee Hong, Nikola S. Nikolov
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
14 years 2 months ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni