A satisfiability formulation of problems on level graphs

Electronic Notes in Discrete Mathematics

Volumn 9, Issue , 2001, Pages 269-277

  Randerath, Bert ^a   Speckenmeyer, Ewald ^a   Boros, Endre ^b   Hammer, Peter ^b   Kogan, Alex ^b   Makino, Kazuhisa ^c   Simeone, Bruno ^d   Cepek, Ondrej ^e  

^a UNIVERSITY OF COLOGNE   (Germany)

^b RUTGERS UNIVERSITY   (United States)

^c OSAKA UNIVERSITY   (Japan)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

^e CHARLES UNIVERSITY   (Czech Republic)

Author keywords

2CNF, level graphs; Level planar, crossing minimization; Satisfiability

Indexed keywords

EID: 26444480508     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00327-0     Document Type: Article

References (12)

1. G. Di Battista and E. Nardelli, Hierarchies and planarity theory, IEEE Transactions on Systems, Man and Cybernetics 18(6) (1988), pp. 1035-1046.
2. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis , Graph Drawing, Prentice Hall (1998).
3. P. Eades, B. McKay and N. C. Wormald, On an edge crossing problem, In Proc. 9th Australian Computer Science Conference, Australian National University (1986), pp. 327-334.
4. M. R. Garey, D. S. Johnson, Crossing number is NP-complete, SIAM Journal on Algebraic and Discrete Methods, 4(3) (1983), pp. 312-316.
5. L. Heath and S. Pemmaraju, Recognizing leveled-planar dags in linear time, In F. J. Brandenburg, editor, Proc. Graph Drawing 95', vol. 1027 of Lecture Notes in Computer Science, Springer Verlag, pp. 300-311.
6. P. Healy and A. Kuusik Characterisation of Level Non-Planar Graphs by Minimal Patterns, Technical Report UL-CSIS-98-4, Department of Computer Science & Information, University of Limerick. e
7. P. Healy and A. Kuusik The Vertex-Exchange Graph and its use in Multi-Level Graph Layout, Technical Report UL-CSIS-99-1, Department of Computer Science & Information, University of Limerick.
8. K. Iwama, et all Local Search Algorithms for Partial MAXSAT, Proc. AAAI'97, pp 263-268 (1997).
9. M. Jünger, E. K. Lee, P. Mutzel and T. Odenthal, A polyhedral approach to the multi-layer crossing minimization problem, In G. Di. Battista, editor, Proc. Graph Drawing 97', vol. 1353 of Lecture Notes in Computer Science, Springer Verlag, pp. 13-24.
10. M. Jünger, P. Mutzel, 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms, Journal on Graph Algorithms and Applications, 1 (1997), pp. 1-25.
11. S. Leipert, Level Planarity Testing and Embedding in Linear Time, 1998, Institut für Informatik, Universität zu Köln, Ph. D. thesis.
12. K. Sugiyama, S. Tagawa and M. Toda, Methods for visual understanding of hierarchical systems, IEEE Trans.on Systems,Man, and Cybernetics, 11(2) (1981), pp. 109-125.