A Satisfiability Formulation of Problems on Level Graphs (2001)
by
B. Randerath
,
E. Speckenmeyer
,
E. Boros
,
P. Hammer
,
A. Kogan
,
K. Makino
,
B. Simeone
,
O. Cepek
| Citations: | 3 - 0 self |
BibTeX
@MISC{Randerath01asatisfiability,
author = {B. Randerath and E. Speckenmeyer and E. Boros and P. Hammer and A. Kogan and K. Makino and B. Simeone and O. Cepek},
title = {A Satisfiability Formulation of Problems on Level Graphs},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this note we present a formulation of two related combinatorial embedding problems concerning level graphs in terms of CNF -formulas. The rst problem is known as level planar embedding and the second as crossing-minimization-problem.
Citations
| 292 | Methods for visual understanding of hierarchical system structures - Sugiyama, Tagawa, et al. - 1981 |
| 187 | D: Crossing Number is NP-Complete - Garey, Johnson |
| 53 | P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms - Jünger, Mutzel - 1997 |
| 27 | N.: On an edge crossing problem - Eades, McKay, et al. - 1986 |
| 24 | Hierarchies and planarity theory - Battista, Nardelli - 1989 |
| 17 | Local search algorithms for partial MAX-SAT - Cha, Iwama, et al. - 1997 |
| 15 | A polyhedral approach to the multi-layer crossing minimization problem - Jünger, Lee, et al. - 1997 |
| 11 | Recognizing leveled-planar dags in linear time - Heath, Pemmaraju - 1996 |
| 4 | Characterisation of Level Non-Planar Graphs by Minimal Patterns - Healy, Kuusik |
| 3 | The vertex-exchange graph and its use in multi-level graph layout - Healy, Kuusik - 1999 |
| 1 | Planarity Testing and Embedding in Linear Time - Leipert, Level - 1998 |
