Add to ORKGA graph separator is a subset of vertices of a graph whose removal divides the graph into small components. Computing small graph separators for various classes of graphs is an important computational task. In this paper, we present a polynomial-time algorithm that uses O(g^{1/2} n^{1/2} log n)-space to find an O(g^{1/2} n^{1/2})-sized separator of a graph having n vertices and embedded on an orientable surface of genus g.Peer reviewe
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
We prove separator theorems in which the size of the separator is minimized with respect to non-nega...
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal parti...
(eng) I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) ...
We introduce the notion of width bounded geometric separator, develop the techniques for its existen...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
We prove separator theorems in which the size of the separator is minimized with respect to non-nega...
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal parti...
(eng) I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) ...
We introduce the notion of width bounded geometric separator, develop the techniques for its existen...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....