46 citations · 60 across the 27 of their papers we have counts for
1 paper · 1 filter
Pallavi Jain, Gur Saran, Kamal Srivastava
Vertex Separation Minimization Problem (VSMP) consists of finding a layout of a graph G = (V,E) which minimizes the maximum vertex cut or separation of a layout. It is an NP-comple…