436 search results - page 40 / 88 » Lombardi Drawings of Graphs |
SIAMCOMP
2000
13 years 9 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
GD
2009
Springer
14 years 2 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
CAE
2007
14 years 3 days ago
2007
The discipline of graph visualization produces pictorial representations of node
STOC
2001
ACM
14 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
14 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...