774 search results - page 1 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
STOC
1987
ACM
13 years 9 months ago
1987
ACM
GD
2005
Springer
13 years 11 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
DAM
2008
13 years 6 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
GD
2009
Springer
13 years 11 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
COCO
2009
Springer
14 years 26 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...