## Upward Numbering Testing for Triconnected Graphs
Chandramouli, M. and Diwan, A. A.
(1996)
Full text not available from this repository. ## AbstractIn this paper, we look at the problem of upward planar drawings of planar graphs whose vertices have preassigned y-coordinates. We give a linear time algorithm for testing whether such an embedding is feasible for triconnected labelled graphs.
Repository Staff Only: item control page References |