Bend-minimum orthogonal drawings of plane 3-graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2573 LNCS, Issue , 2002, Pages 367-378

  Rahman, Md Saidur ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; Bend; Graph; Graph drawing; Orthogonal drawing

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; DRAWING (GRAPHICS);

BEND; EDGE CHANGES; GRAPH; GRAPH DRAWING; LINEAR-TIME ALGORITHMS; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; VERTICAL DIRECTION; EXTENDED ABSTRACTS;

GRAPH THEORY;

EID: 77950840863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_32     Document Type: Conference Paper

References (9)

1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall Inc., Upper Saddle River, New Jersey, 1999.
2. G. Di Battista, G. Liotta, and F. Vargiu, Spirality and optimal orthogonal drawings, SIAM J. Comput. 27(6), pp. 1764-1811, 1998.
3. A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing'96, Lect. Notes in Computer Science, 1190, pp. 201-226, 1997.
4. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.
5. S. Nakano and M. Yoshikawa, A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs, Proc. of Graph Drawing' 00, Lect. Notes in Computer Science, 1984, pp. 296-307, 2001.
6. M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bendoptimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Alg. and Appl., http: //www.cs.brown.edu/publications/jgaa/, 3(4), pp. 31-62, 1999.
7. M. S. Rahman, M. Naznin and T. Nishizeki, Orthogonal drawings of plane graphs without bends, Proc. of Graph Drawing'01, Lect. Notes in Computer Science, 2265, pp. 392-406, 2002.
8. J. Storer, On minimum node-cost planar embeddings, Networks, 14, pp. 181-212, 1984.
9. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16, pp. 421-444, 1987.