@inproceedings{44c76c68935d4729bd533973f986d523,

title = "Branch and bound algorithm for vertex bisection minimization problem",

abstract = "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.",

keywords = "Branch and bound, Graph layout, NP-complete, Vertex bisection, Vertex width",

author = "Pallavi Jain and Gur Saran and Kamal Srivastava",

note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media Singapore 2016.; 9th International Conference on Advanced Computing and Communication Technologies, ICACCT 2015 ; Conference date: 28-11-2015 Through 29-11-2015",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-981-10-1023-1_2",

language = "English",

isbn = "9789811010217",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "17--23",

editor = "H.A. Nagarajaram and Choudhary, {Ramesh K.} and Mandal, {Jyotsna Kumar} and Nitin Auluck",

booktitle = "Advanced Computing and Communication Technologies - Proceedings of the 9th ICACCT, 2015",

address = "Germany",

}