Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based representation vertices and edges correspond to axis-parallel boxes on an underlying integer grid; boxes can be further constrained in their shapes and interactions by additional problem-specific constraints. We describe a general d-dimensional model for grid representation problems. This model can be used to solve a variety of NP-hard graph problems, including pathwidth, bandwidth, optimum st-orientation, area-minimal (bar-k) visibility representation, boxicity-k graphs and others. We implemented SAT-models for all of the above problems and evaluated them on the Rome graphs collection. The experiments show that our model successfully solves NP-hard problems within few minutes on small to medium-size Rome graphs.
- 2.Biedl, T., Bläsius, T., Niedermann, B., Nöllenburg, M., Prutkin, R., Rutter, I.: A versatile ILP/SAT formulation for pathwidth, optimum st-orientation, visibility representation, and other grid-based graph drawing problems. CoRR abs/1308.6778 (2013)Google Scholar
- 3.Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2009)Google Scholar
- 9.Chen, D.S., Batson, R.G., Dang, Y.: Applied Integer Programming. Wiley (2010)Google Scholar
- 20.Gurobi Optimization, Inc.: Gurobi optimizer reference manual (2013)Google Scholar
- 26.Nöllenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE TVCG 17(5), 626–641 (2011)Google Scholar
- 30.Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proc. First Ann. Symp. Comput. Geom., SCG 1985, pp. 147–152. ACM, New York (1985)Google Scholar