Record Details

DSpace at IIT Bombay

View Archive Info
 

Metadata

 
Field Value
 
Title Upward numbering testing for triconnected graphs
 
Names CHANDRAMOULI, M
DIWAN, AA
Date Issued 1996 (iso8601)
Abstract 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.
Genre Article; Proceedings Paper
Topic Representations
Identifier GRAPH DRAWING,1027,140-151