Title of article :
A Satisfiability Formulation of Problems on Level Graphs
Author/Authors :
Randerath، نويسنده , , Bert and Speckenmeyer، نويسنده , , Ewald and Boros، نويسنده , , Endre and Hammer، نويسنده , , Peter and Kogan، نويسنده , , Alex and Makino، نويسنده , , Kazuhisa and Simeone، نويسنده , , Bruno and Cepek، نويسنده , , Ondrej، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Pages :
9
From page :
269
To page :
277
Abstract :
In this note we present a formulation of two related combinatorial embedding problems concerning level graphs in terms of CNF-formulas. The first problem is known as level planar embedding and the second as crossing-minimization-problem.
Keywords :
satisfiability , 2CNF , level graphs , level-planar , crossing-minimization
Journal title :
Electronic Notes in Discrete Mathematics
Serial Year :
2001
Journal title :
Electronic Notes in Discrete Mathematics
Record number :
1453245
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1453245
بازگشت