Logo

Login | Create Account

The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. [Conference Paper]

Full text not available from this repository.

Abstract

In this paper we consider the problems of testing a multi-level graph for planarity and laying out a multi-level graph. We introduce a new abstraction that we call a vertex-exchange graph. We demonstrate how this concept can be used to solve these problems by providing clear and simple algorithms for testing a multi-level graph for planarity and laying out a multi-level graph when planar. We also show how the concept can be used to solve other problems relating to multi-level graph layout.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
M Methods > M.600 Planar
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.999 Others
P Styles > P.540 Planar
ID Code:329
Deposited By:Maciejak, Agnes
Deposited On:23 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1731&spage=205

Repository Staff Only: item control page

References

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing, Algorithms for the Visualization of Graphs. Prentice Hall, 1999.

2. P. Eades and D. Kelly. Heuristics for drawing 2-layered networks. Ars Combinatoria, 21-A:89-98. 1986.

3. P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424-437, 1990.

4. P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379-403, 1994.

5. P. Healy and A. Kuusik. Characterisation of level non-planar graphs by minimal patterns. Technical Report UL-CSIS-98-4, University of Limerick, 1998.

6. M. Jünger, E. K. Lee, P. Mutzel, and T. Odenthal. A polyhedral approach to multi-layer crossing minimization problem. In Graph Drawing, 5th International Symposium, GD'97, Rome, Italy, September 1997, volume 1353 of Lecture Notes in Computer Science, pages 13-24. Springer-Verlag, 1997.

7. M. Jünger and P. Mutzel. Exact and heuristic algorithm for 2-layer crossing minimization. In Graph Drawing, Symposium on Graph Drawing, GD'95. Passau, Germany, September 20-22, 1995, volume 1027 of Lecture Notes in Computer Science, pages 337-348. Springer-Verlag, 1995.

8. S. Leipert. Level planarity testing and embedding in linear time. PhD thesis, Institut für Informatik, Universität zu Köln, 1998.

9. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, 1981.

10. J. Utech, J. Branke, H. Schmeck, and P. Eades. An evolutionary algorithm for drawing directed graphs. In Proceedings of the 1998 International Conference on Imaging Science, Systems, and Technology (CISST'98), pages 154-160, 1998.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.