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 %.