A new NP-completeness result for 2-stack 1-queue layouts, plus a conflict-minimizing heuristic that beats adapted eLen and ceilFloor on most benchmark graph classes.
Discrete Applied Mathematics 122(1-3), 93–115 (2002)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
A new NP-completeness result for 2-stack 1-queue layouts, plus a conflict-minimizing heuristic that beats adapted eLen and ceilFloor on most benchmark graph classes.