One sided crossing minimization is NP-hard for sparse graphs

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

Volumn 2265 LNCS, Issue , 2002, Pages 115-123

  Muñoz, Xavier ^a   Unger, W ^b   Vrt'o, Imrich ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPHIC METHODS;

BASIC BUILDING BLOCK; BIPARTITE GRAPHS; CROSSING MINIMIZATION; DENSE GRAPHS; EDGE CROSSING; HIERARCHICAL GRAPHS; PARALLEL LINE; SPARSE GRAPHS;

GRAPH THEORY;

EID: 84867476625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_10     Document Type: Conference Paper

References (16)

1. Demetrescu, C., Finocchi, I.: Removing Cycles for Minimizing Crossings. J. Experimental Algorithmics. To appear
2. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall (1999)
3. Eades, P. Wormald, N.C.: Edge Crossings in Drawing Bipartite Graphs. Algorithmica 11 (1994) 379-403
4. Eades, P., Whitesides, S.: Drawing Graphs in Two Layers. Theoretical Computer Science 131 (1994) 361-374
5. Garey, M.R., and Johnson, D.S.: Crossing Number is NP-Complete. SIAM J. Algebraic and Discrete Methods 4 (1983) 312-316
6. Gavril, F.: Some NP-Complete Problems on Graphs. In: 11th Conf. on Information Sciences and Systems. John Hopkins University Press, Baltimore (1977) 91-95
7. Jünger, M., Mutzel, P.: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms and Algorithms 1 (1999) 11-25
8. Matuszewski, C., Schönfeld, R., Molitor, P.: Using Sifting for k-Layer Crossing Minimization. In: 7th Intl. Symp. on Graph Drawing. Lecture Notes in Computer Science, Vol. 1731. Springer-Verlag, Berlin (1999) 217-224
9. Mutzel, P.: Optimization in Leveled Graphs. In: Pardalos, M., Floudas, C.A. (eds.): Encyclopedia of Optimization. Kluwer, Dordrecht (2001)
10. Purchase, H.: Which Aesthetic Has the Greatest Effect on Human Understanding? In: 5th Intl. Symposium on Graph Drawing. Lecture Notes in Computer Science, Vol. 1353. Springer-Verlag, Berlin (1997) 248-261
11. Sechen, C.: VLSI Placement and Global Routing Using Simulated Annealing, Kluwer, Dordrecht (1988)
12. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt'o, I.: On Bipartite Drawings and the Linear Arrangement Problem. SIAM J. Computing 30 (2000) 1773-1789
13. Stallmann, M., Brglez, F., Ghosh, D.: Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. J. Experimental Algorithmics. To appear
14. Stanley, R. H.: Enumerative Combinatorics. Wadsworth & Brooks, Monterey (1986)
15. 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
16. Yamaguchi, A., Sugimoto, A.: An Approximation Algorithm for the Two-Layered Graph Drawing Problem. In: 5th Annual Intl. Conf. on Computing and Combinatorics. Lecture Notes in Computer Science, Vol. 1627. Springer-Verlag, Berlin (1999) 81-91