AbstractWe first show that the removal of 4√n/ϵ vertices from an n-vertex planar graph with non-negative vertex weights summing to no more than 1 is sufficient to cleave or recursively separate it into components of weight no more than a given ϵ, thus improving on the 2√6 √n/ϵ bound shown in [6]. We then derive worst-case bounds on the number of vertices necessary to separate a planar graph of a given radius into components of weight no more than ϵ
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that nee...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
AbstractWe first show that the removal of 4√n/ϵ vertices from an n-vertex planar graph with non-nega...
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...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
In the previous section we saw that the planar separator theorem provides us with a procedure to sep...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. I...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that nee...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
AbstractWe first show that the removal of 4√n/ϵ vertices from an n-vertex planar graph with non-nega...
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...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
In the previous section we saw that the planar separator theorem provides us with a procedure to sep...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. I...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that nee...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
In this paper we consider the problem of finding a graph separator of a given size that decomposes t...
DOI
Add to ORKG