Sciweavers

79 search results - page 1 / 16
» Planarity of iterated line graphs
Sort
View
DM
2008
111views more  DM 2008»
13 years 4 months ago
Planarity of iterated line graphs
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
Mohammad Ghebleh, Mahdad Khatirinejad
GD
2007
Springer
13 years 11 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 4 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
JGT
2008
74views more  JGT 2008»
13 years 4 months ago
Straight line embeddings of cubic planar graphs with integer edge lengths
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
Jim Geelen, Anjie Guo, David McKinnon
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 6 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable