712 search results - page 56 / 143 » On Spectral Graph Drawing |
123
Voted
STOC
2001
ACM
16 years 2 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...
129
click to vote
SODA
2010
ACM
15 years 11 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...
120
click to vote
COMPGEOM
2004
ACM
15 years 7 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...
107
Voted
COCOON
2005
Springer
15 years 7 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...
120
Voted
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...