M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In F. J. Brandenburg, editor, Proc. Graph Drawing 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Stack And Queue Layouts Of Directed Acyclic Graphs: Part II - Heath, Pemmaraju (1999) (16 citations) (Correct)
....AND QUEUE LAYOUTS OF DAGS: PART II 1589 ## ## ## ## ## ## ## ## ## ## ## ## ## ## # # # # # # # # # # # # 6 ## ## 4 6 2 3 5 8 7 6 1 Fig. 1.1. A 2 stack dag, each of whose biconnected components are 1 stack dags. the work of Di Battista and Nardelli [5] and Chandramouli and Diwan [3, 4]. These authors assume certain restrictions on the given dag. In particular, Di Battista and Nardelli present an algorithm to determine if a dag with a single source (node with in degree 0) has a leveled planar embedding. Chandramouli and Diwan present an algorithm to determine if a triconnected ....
....# 3 XXXXX Xz u 2 u 4 u 6 u 8 u 5 u 1 u 7 u 9 # 1 # 2 Fig. 2.1. A leveled planar dag. The first step of our algorithm, the one that recognizes leveled planar dags, was sketched in [7] and extends the work of Di Battista and Nardelli [5] and Chandramouli and Diwan [3, 4]. These authors assume certain restrictions on the given dag. In particular, Di Battista and Nardelli [5] present a linear time algorithm to determine if a given hierarchy has a leveled planar embedding. A hierarchy is a leveled dag with a single source. Hierarchies are widely used in many fields ....
[Article contains additional citation context not shown here]
M. Chandramouli and A. A. Diwan, Upward numbering testing for triconnected graphs, in Graph Drawing, GD '95, F. J. Brandenburg, ed., Lecture Notes in Comput. Sci. 1027, Springer-Verlag, Berlin, 1996, pp. 140--151.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In F. J. Brandenburg, editor, Proc. Graph Drawing 1995.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Clustered Level Planarity - Forster, Bachmaier (2004) (Correct)
No context found.
Chandramouli, M., Diwan, A.A.: Upward Numbering Testing for Triconnected Graphs. In: Proc. Graph Drawing, GD 1995, LNCS, Vol. 1027. Springer (1996) 140--151
Track Planarity Testing and Embedding - Bachmaier, Brandenburg, Forster (2004) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Clustered Level Planarity - Forster, Bachmaier (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Radial Level Planarity Testing and Embedding - In Linear Time (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In F. J. Brandenburg, editor, Proc. Graph Drawing 1995.
Track Planarity Testing and Embedding - Bachmaier, Brandenburg, Forster (2004) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
M. Chandramouli and A. A. Diwan. Upward numbering testing for triconnected graphs. In Proc. Graph Drawing, GD 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC