Package org.graph4j.vsp

package org.graph4j.vsp

Algorithms for the Vertex Separator Problem (VSP).

Related Packages

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.

Class	Description
BacktrackVertexSeparator	WORK IN PROGRESS.
GreedyVertexSeparator
VertexSeparator	Utility class for representing a vertex separator set.
VertexSeparatorAlgorithm
VertexSeparatorBase	The vertex separator problem (VSP) is to find a partition of V into nonempty three classes A, B, C such that there is no edge between A and B, max(|A|,|B|) <= f(n) and |C| is minimum.