A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem

Authors:
Patrick Healy;Nikola S. Nikolov
Affiliations:
-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 5
Cited 5

How to draw a directed graph

Journal of Information Processing
Layered drawings of digraphs

Drawing graphs
Width-restricted layering of acyclic digraphs with consideration of dummy nodes

Information Processing Letters
How to Layer a Directed Acyclic Graph

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Facets of the Directed Acyclic Graph Layering Polytope

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Graph layering by promotion of nodes

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

Journal of Experimental Algorithmics (JEA)
Graph layering by promotion of nodes

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Drawing graphs with GLEE

GD'07 Proceedings of the 15th international conference on Graph drawing
Upward planarization layout

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of layering Directed Acyclic Graphs, an NP-hard problem. We show that some useful variants of the problem are also NP-hard. We provide an Integer Linear Programming formulation of a generalization of the standard problem and discuss how a branch-and-bound algorithm could be improved upon with cutting planes. We then describe a separation algorithm for two classes of valid inequalities that we have identified - one of which is facet-defining - and discuss their efficacy.