ICAR Research Data Repository for Knowledge Management
Upward numbering testing for triconnected graphs
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Upward numbering testing for triconnected graphs
|
|
| Creator |
CHANDRAMOULI, M
DIWAN, AA |
|
| Subject |
representations
|
|
| Description |
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.
|
|
| Publisher |
SPRINGER-VERLAG BERLIN
|
|
| Date |
2011-10-23T11:26:02Z
2011-12-15T09:11:08Z 2011-10-23T11:26:02Z 2011-12-15T09:11:08Z 1996 |
|
| Type |
Article; Proceedings Paper
|
|
| Identifier |
GRAPH DRAWING,1027,140-151
3-540-60723-4 0302-9743 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15116 http://hdl.handle.net/100/1871 |
|
| Source |
Symposium on Graph Drawing (GD 95),PASSAU, GERMANY,SEP 20-22, 1995
|
|
| Language |
English
|
|