Abstract

Given an undirected and connected graph G=(V,E) and two vertices s,t∈V, a vertex subset S that separates s and t is called an s-t separator, and an s-t separator is called minimal if no proper subset of S separates s and t. Moreover, we say that a set S is
... read more