On the Exact Solution of VSP for General and Structured Graphs: Models and Algorithms
In this chapter the vertex separation problem (VSP) is approached. VSP is NP-hard with important applications in VLSI, computer language compiler design, and graph drawing, among others. In the literature there are several exact approaches to solve structured graphs and one work that proposes an integer linear programming (ILP) model for general graphs. Nevertheless, the model found in the literature generates a large number of variables and constraints, and the approaches for structured graphs assume that the structure of the graphs is known a priori. In this work we propose a new ILP model based on a precedence representation scheme, an algorithm to identify whether or not a graph has a Grid structure, and a new benchmark of scale-free instances. Experimental results show that our proposed ILP model improves the average computing time of the reference model in 79.38 %, and the algorithm that identifies Grid-structured graphs has an effectiveness of 100 %.
We would like to thank the National Council of Science and Technology of Mexico (CONACYT), the General Direction of Higher Technological Education (DGEST) and the Ciudad Madero Institute of Technology (ITCM) for their financial support. We also thank IBM Academic Initiative for allowing us to use their optimization engine CPLEX v12.5.
- 4.Leiserson, C.: Area-efficient graph layouts (for VLSI). In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 270–281 (1980)Google Scholar
- 5.Bodlaender, H., Gustedt, J., Telle, J.: Linear time register allocation for a fixed number of registers. In: Proceedings of the Symposium on Discrete Algorithms. (1998)Google Scholar
- 9.Skodinis, K.: Computing optimal linear layouts of trees in linear time. In: Paterson, M. (ed.) Proceedings of 8th Annual European Symposium on Algorithms. LNCS, vol. 1879, pp. 403–414. Springer, London (2000)Google Scholar
- 11.Chen, D., Batson, R., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley publisher. ISBN: 978-1-118-21002-4. (2010)Google Scholar
- 13.Barabasí, A.: Emergence of Scaling in Complex Networks. Handbook of graphs and networks: from the Genome of the Internet, pp. 69–84. (2005)Google Scholar
- 14.López, T.: Complejidad Computacional Estructural en Redes Complejas. PhD Thesis. Universidad Autónoma de Nuevo León, México (2012)Google Scholar
- 15.Eppstein, D., Wang, J.: A steady state model for graphs power laws. arXiv preprint cs/0204001. (2002)Google Scholar