Breaking cycles for minimizing crossings

ACM Journal of Experimental Algorithmics

Volumn 6, Issue , 2001, Pages

  Demetrescu, Camil ^a   Finocchi, Irene ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645616971     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/945394.945396     Document Type: Article

References (34)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Approximate Solution of NP-Hard Optimization Problems. Springer Verlag, 1999.
2. R. Bar-Yehuda. One for the price of two: A unified approach for approximating covering problems. In Proc. 1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'98), pages 49-62, 1998.
3. R. Boisvert, R. Pozo, K. Remington, R. Barrett, and J. Dongarra. Matrix Market: a web resource for test matrix collections. In R. Boisvert, editor, The Quality of Numerical Software: Assessment and Enhancement, pages 125-137. Chapman and Hall, London, 1997. Matrix Market is available at the URL: http://math.nist.gov/MatrixMarket/.
4. M.J. Carpano. Automatic display of hierarchized graphs for computer-aided decision analysis. IEEE Trans. Syst. Man Cybern., 10(11): 705-715, 1980.
5. T. Catarci. The assignment heuristic for crossing reduction. IEEE Trans. Syst. Man Cybern., 25(3): 515-521, 1995.
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill, 2001.
7. P. Crescenzi, C. Demetrescu, I. Finocchi, and R. Petreschi. Reversible execution and visual- ization of programs with Leonardo. Journal of Visual Languages and Computing, 11(2), 2000. System home page: http://www.dis.uniroma1. it/?demetres/Leonardo/.
8. C. Demetrescu and I. Finocchi. Leonardo's repository of animated algorithms. Available at http://www.dis.uniroma1.it/?demetres/Leonardo/ ProgramsRepository.html.
9. C. Demetrescu and I. Finocchi. Combinatorial algorithms for feedback problems in directed graphs. Information Processing Letters, 86(3): 129-136, 2003.
10. C. Demetrescu and I. Finocchi. Break the "right" cycles and get the "best" drawing. In B.E. Moret and A.V. Goldberg, editors, Proc. of the 2nd International Workshop on Algorithm Engineering and Experiments (ALENEX'00), pages 171-182, 2000.
11. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River, NJ, 1999.
12. S. Dresbach. A new heuristic layout algorithm for dags. In U. Derigs and A. Drexl, editors, Operations Research Proceedings, pages 121-126, 1994.
13. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21: 89-98, 1986.
14. P. Eades and X. Lin. A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics, 12: 15-26, 1995.
15. P. Eades, X. Lin, and W.F. Smyth. A Fast and Effective Heuristic for the Feedback Arc Set Problem. Information Processing Letters, 47(6): 319-323, 1993.
16. P. Eades and S. Whitesides. Drawings graphs in two layers. Theoretical Computer Science, 131: 361-374, 1994.
17. P. Eades and N.C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11: 379-403, 1994.
18. G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, pages 62-71, 1995.
19. E.R. Gansner, E. Koutsofios, S.C. North, and K.P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19: 214-230, 1993.
20. M.R.. Garey and D.S. Johnson. Computers and Intractability: a Guide to Theory of NP-completeness. W.H.Freeman, 1979.
21. A.V. Goldberg. Selecting problems for algorithm evaluation. In Proc. 3-rd Workshop on Algorithm Engineering (WAE'99), LNCS 1668, pages 1-11, 1999.
22. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms and Applications, 1(1): 1-25, 1997.
23. D.E. Knuth. The Stanford GraphBase: A platform for combinatorial computing. Addison-Wesley, 1993.
24. E. Makinen. Experiments in drawing 2-level hierarchical graphs. Technical Report A-1988-1, Department of Computer Science, University of Tampere, 1988.
25. C. Matuszewski, R. Schönfeld, and P. Molitor. Using sifting for k-layer straightline crossing minimization. In Proc. 7th International Symposium on Graph Drawing (GD'99), LNCS 1731, pages 217-224, 1999.
26. P. Mutzel, C. Gutwenger, R. Brockenauer, and S. Fialko. A library of algorithms for graph drawing. Lecture Notes in Computer Science, 1547: 456-457, 1998. Project URL: http://www.mpi-sb.mpg.de/AGD/.
27. S. North. 5114 directed graphs. Available at ftp://ftp.research.att.com/ dist/drawdag/, 1995.
28. H.C. Purchase, R.F. Cohen, and M.I. James. An experimental study of the basis for graph drawing algorithms. ACM Journal on Experimental Algorithmics, 2, 1997.
29. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conference on Computer-Aided Design (ICCAD'93), pages 42-47, 1993.
30. P.D. Seymour. Packing directed circuits fractionally. Combinatorica, 15: 281-288, 1995.
31. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern., 11(2): 109-125, 1981.
32. V. Valls, R. Marti, and P. Lino. A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs. J. Operational Research, 90: 303-319, 1996.
33. J.N. Warfield. Crossing theory and hierarchy mapping. IEEE Trans. Syst. Man Cybern., 7(7): 502-523, 1977.
34. A. Yamaguchi and A. Sugimoto. An approximation algorithm for the two-layered graph drawing problem. In Proc. 5th Annual Int. Conference on Computing and Combinatorics (COCOON'99), pages 81-91, 1999.