Two new heuristics for two-sided bipartite graph drawing

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

Volumn 2528 LNCS, Issue , 2002, Pages 312-319

  Newton, Matthew ^a   Sýkora, Ondrej ^a   Vrt'o, Imrich ^b  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE CROSSING NUMBERS; BIPARTITE GRAPHS; HEURISTIC STRATEGY; LINEAR ARRANGEMENTS; STOCHASTIC HILL-CLIMBING;

HEURISTIC METHODS; ITERATIVE METHODS;

DRAWING (GRAPHICS);

EID: 84867444969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. Bastert, O., Matuszewski, C.: Layered drawings of digraphs. In: Drawing Graphs, Methods and Models (eds. Kaufmann, M., Wagner D.), LNCS 2025, Springer (2001) 87-118
2. Boisvert, R., Pozo, R., Remington, K., Barrett, R., Dongarra, J.: Matrix Market: a web resource for test matrixcollections. In: The Quality of Numerical Software: Assessment and Enhancement (ed. Boisvert, R.), Chapman and Hall, London, (1997) 125-137, MatrixMarket is available at the url: http://math.nist.gov/MatrixMarket/
3. Dresbach, S.: A new heuristic layout algorithm for DAGs. In: Operations Research Proceedings 1994 (eds. Derigs, U., Drexl, A.B.A.), Springer (1994) 121-126
4. Demetrescu, C., Finocchi, I.: Removing cycles for minimizing crossings. J. Experimental Algorithmics, to appear
5. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall (1999)
6. Eades, P., Kelly, D.: Heuristics for reducing crossings in 2-layered networks. Ars Combin. 21 (1986) 89-98
7. Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica 11 (1994) 379-403
8. Garey, M.R., Johnson, D.S.: Crossing number is np-complete. SIAM J. Algebraic Disc. Meth. 4 (1983) 312-316
9. Juvan, M., Mohar, B.: Optimal linear labellings and eigenvalues of graphs. Discrete Appl. Math. 36 (1992) 153-168
10. Jünger, M., Mutzel, P.: 2-Layer straight line crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1 (1997) 1-25
11. Knuth, D.E.: The Stanford GraphBase: A platform for combinatorial computing. Addision-Wesley, (1993)
12. Koren, Y., Harel, D.: A multi-scale algorithm for the linear arrangement problem. In: 28th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG'2002), LNCS, Springer (2002), to appear
13. Matuszewski, C., Schönfeld, R., Molitor, P.: Using sifting for k-layer straightline crossing minimization. In: 7th Intl. Symp. on Graph Drawing (GD'99), LNCS 1731, Springer (1999) 217-224
14. Mutzel, P.: Optimization in leveled graphs. In: Pardalos, M., Floudas C.A. (eds.): Encyclopedia of Optimization. Kluwer, Dordrecht (2001)
15. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C. The Art of Scientific Computing. Second edition, Cambridge University Press (1992) http://www.nr.com/
16. Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: 5th Intl. Symp. on Graph Drawing (GD'97), LNCS 1353, Springer (1998) 248-261
17. Sarrafzadeh, M., Wong, C.K.: An Introduction to VLSI Physical Design. McGraw Hill, (1996)
18. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I.: On bipartite drawings and the linear arrangement problem. SIAM J. Computing 30 (2001), 1773-1789
19. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I.: A new lower bound for the bipartite crossing number with algorithmic applications. Theoretical Computer Science 245 (2000) 281-294
20. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics SMC-11 (1981) 109-125