Vertex Bisection Minimization problem (VBMP) consists of partitioning the vertex set V of a graph G = (V, E) into two sets B and B′ where |B| = ⎿|V|/2⏌ such that its vertex width (VW) is minimized. Vertex width is defined as the number of vertices in B which are adjacent to at least one vertex in B′. It is an NP-complete problem in general but polynomially solvable for trees and hypercubes. VBMP has applications in fault tolerance and is related to the complexity of sending messages to processors in interconnection networks via vertex disjoint paths. In this paper, we propose a branch and bound algorithm for VBMP which uses a greedy heuristic to determine upper bound for the vertex width. We have devised a strategy to obtain lower bounds on the vertex width of partial solutions. A tree pruning procedure which reduces the size of search tree is also incorporated into the algorithm. This algorithm has been experimented on selected benchmark graphs. Results indicate that except for five of the selected graphs, the algorithm is able to, run through the search tree very fast.
CITATION STYLE
Jain, P., Saran, G., & Srivastava, K. (2016). Branch and bound algorithm for vertex bisection minimization problem. In Advances in Intelligent Systems and Computing (Vol. 452, pp. 17–23). Springer Verlag. https://doi.org/10.1007/978-981-10-1023-1_2
Mendeley helps you to discover research relevant for your work.