AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of size O(√gkn). The upper bound is best possible to within a constant factor. This extends the known results on planar graphs and similar results about vertex separators. We apply the edge separator to the isoperimetric number problem, graph embeddings and lower bounds for crossing numbers
International audienceGiven G = (V, E) a connected undirected graph and a positive integer β(|V |), ...
The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subs...
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
$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 ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges ...
SIGLEAvailable from TIB Hannover: RR1912(91-125) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. ...
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...
We prove separator theorems in which the size of the separator is minimized with respect to non-nega...
Given G = (V, E) a connected undirected graph and a positive integer β(|V|), the vertex separator pr...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
International audienceGiven G = (V, E) a connected undirected graph and a positive integer β(|V |), ...
International audienceGiven G = (V, E) a connected undirected graph and a positive integer β(|V |), ...
The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subs...
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
$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 ...
$n$-vertex graph of positive genus $g$ and maximal degree $k$ has an $O(\sqrt{gkn})$ edge separator....
Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges ...
SIGLEAvailable from TIB Hannover: RR1912(91-125) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
Graph separators are a powerful tool that are motivated by divide and conquer algorithms on graphs. ...
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...
We prove separator theorems in which the size of the separator is minimized with respect to non-nega...
Given G = (V, E) a connected undirected graph and a positive integer β(|V|), the vertex separator pr...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
International audienceGiven G = (V, E) a connected undirected graph and a positive integer β(|V |), ...
International audienceGiven G = (V, E) a connected undirected graph and a positive integer β(|V |), ...
The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subs...
A graph separator is a subset of vertices of a graph whose removal divides the graph into small comp...
DOI
Add to ORKG