326 search results - page 22 / 66 » A Library of Algorithms for Graph Drawing |
SOFTVIS
2003
ACM
14 years 3 months ago
2003
ACM
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
GD
2001
Springer
14 years 2 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
GD
2009
Springer
14 years 2 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...