430 search results - page 41 / 86 » Drawing Graphs with GLEE |
CAE
2007
15 years 10 days ago
2007
The discipline of graph visualization produces pictorial representations of node
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...