A Framework for Circular Drawings of Networks
作者： Janet M. Six , Ioannis G. Tollis
关键词: Outerplanar graph 、 State (computer science) 、 Theoretical computer science 、 Graph 、 Computer science 、 Connectivity 、 Structure (mathematical logic) 、 Algorithm
摘要: Drawings of graphs which show the inherent strengths and weaknesses structures with clustered views would be advantageous additions to many network design tools. In this paper we present a framework for producing circular drawings networks represented by non-biconnected graphs. Furthermore, produced these techniques clearly biconnectivity structure given networks. We also include results an extensive experimental study shows our approach significantly outperform current state art.
springer.com
core.ac.uk
sci-hub.st 参考文章(12)
Ioannis G. Tollis, Chunliang Xia, Drawing Telecommunication Networks graph drawing. pp. 206- 217 ,(1994) , 10.1007/3-540-58950-3_372
Janet M. Six, Ioannis G. Tollis, Circular Drawings of Biconnected Graphs algorithm engineering and experimentation. pp. 57- 73 ,(1999) , 10.1007/3-540-48518-X_4
Uğur Doğrusöz, Brendan Madden, Patrick Madden, Circular Layout in the Graph Layout Toolkit graph drawing. pp. 92- 100 ,(1996) , 10.1007/3-540-62495-3_40
Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G Tollis, Algorithms for drawing graphs: an annotated bibliography Computational Geometry: Theory and Applications. ,vol. 4, pp. 235- 282 ,(1988) , 10.1016/0925-7721(94)00014-X
G. Kar, B. Madden, R.S. Gilbert, Heuristic layout algorithms for network management presentation services IEEE Network. ,vol. 2, pp. 29- 36 ,(1988) , 10.1109/65.10027
Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, An experimental comparison of four graph drawing algorithms Computational Geometry: Theory and Applications. ,vol. 7, pp. 303- 325 ,(1997) , 10.1016/S0925-7721(96)00005-3
C. Esposito, Graph graphics: Theory and practice Computers & Mathematics With Applications. ,vol. 15, pp. 247- 253 ,(1988) , 10.1016/0898-1221(88)90208-8
Sandra L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs Information Processing Letters. ,vol. 9, pp. 229- 232 ,(1979) , 10.1016/0020-0190(79)90075-9
Roberto Tamassia, Peter Eades, Giuseppe Di Battista, Ioannis G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs ,(1998)
Aaron Kershenbaum, Telecommunications Network Design Algorithms ,(1993)