Monotone drawings of graphs

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

Volumn 6502 LNCS, Issue , 2011, Pages 13-24

  Angelini, Patrizio ^a   Colasante, Enrico ^a   Di Battista, Giuseppe ^a   Frati, Fabrizio ^a   Patrignani, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

A-MONOTONE; FUTURE RESEARCH DIRECTIONS; MONOTONICITY; OPEN PROBLEMS; PLANAR DRAWING; PLANAR GRAPH; PLANARITY; STRAIGHT-LINE DRAWINGS;

DRAWING (GRAPHICS); TREES (MATHEMATICS);

TREES (MATHEMATICS); GRAPH THEORY;

EID: 79952267117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18469-7_2     Document Type: Conference Paper

References (14)

1. Angelini, P., Colasante, E., di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. Tech. Report 178, Dip. di Informatica e Automazione, Università Roma Tre (2010)
2. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Alg. Appl. 14(1), 19-51 (2010)
3. Arkin, E.M., Connelly, R., Mitchell, J.S.: On monotone paths among obstacles with applications to planning assemblies. In: SoCG 1989, pp. 334-343 (1989)
4. Brocot, A.: Calcul des rouages par approximation, nouvelle methode. Revue Chronometrique 6, 186-194 (1860)
5. Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 77-88. Springer, Heidelberg (2007)
6. Chiba, N., Nishizeki, T.: Planar Graphs: Theory and Algorithms. In: Annals of Discrete Mathematics, vol. 32, North-Holland, Amsterdam (1988)
7. Di Battista,G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175-198 (1988)
8. Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQRtrees. Algorithmica 15(4), 302-318 (1996)
9. Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comp. 25(5), 956-997 (1996)
10. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comp. 31(2), 601-625 (2001)
11. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77-90. Springer, Heidelberg (2001)
12. Moitra, A., Leighton, T.: Some results on greedy embeddings in metric spaces. In: Foundations of Computer Science (FOCS 2008), pp. 337-346 (2008)
13. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science 344(1), 3-14 (2005)
14. Stern, M.A.: Ueber eine zahlentheoretische funktion. Journal fur die reine und angewandte Mathematik 55, 193-220 (1858)