Upward Numbering Testing for Triconnected Graphs
Chandramouli, M. and Diwan, A. A. (1996) Upward Numbering Testing for Triconnected Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 140-151 (Official URL: http://dx.doi.org/10.1007/BFb0021798).
Full text not available from this repository.
In 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