Paper

Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem

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-complete problem in general for which metaheuristic techniques can be applied to find near optimal solution... (read more)

Results in Papers With Code
(↓ scroll down to see all results)