Optimal k-level planarization and crossing minimization

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

Volumn 6502 LNCS, Issue , 2011, Pages 238-249

  Gange, Graeme ^a   Stuckey, Peter J ^a   Marriott, Kim ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CROSSING MINIMIZATION; EDGE CROSSING; EXACT APPROACH; HIERARCHICAL NETWORK; HYBRID APPROACH; NP-HARD; OPTIMAL ORDERING; PLANARITY; PLANARIZATION; SUBGRAPHS; TWO LAYERS;

BENCHMARKING; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); HEURISTIC ALGORITHMS;

OPTIMIZATION;

EID: 79952266407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18469-7_22     Document Type: Conference Paper

References (10)

1. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
2. Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. In: Graph Drawing, pp. 318-333 (1997)
3. Gansner, E., North, S.: An open graph visualization system and its applications to software engineering. Software: Practice and Experience 30(11), 1203-1233 (2000)
4. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109-125 (1981)
5. Matuszewski, C., Schönfeld, R., Molitor, P.: Using sifting for k-layer straightline crossing minimization. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 217-224. Springer, Heidelberg (1999)
6. Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1(1), 1-25 (1997)
7. Jünger, M., Lee, E.K., Mutzel, P., Odenthal, T.: A polyhedral approach to the multi-layer crossing minimization problem. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 13-24. Springer, Heidelberg (1997)
8. Randerath, B., Speckenmeyer, E., Boros, E., Hammer, P., Kogan, A., Makino, K., Simeone, B., Cepek, O.: A satisfiability formulation of problems on level graphs. Electronic Notes in Discrete Mathematics 9, 269-277 (2001)
9. Healy, P., Kuusik, A.: The vertex-exchange graph: A new concept for multi-level crossing minimisation. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 205-216. Springer, Heidelberg (1999)
10. Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1-26 (2006)