We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present a polynomial time approximation scheme for both the connected and unconnected version
In this paper, we consider the minimum feedback vertex set problem in graphs, i.e., the problem of f...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum ...
AbstractThe feedback vertex set problem for hypergraphs is considered and an efficient approximation...
In this paper we consider the minimum feedback vertex set problem in graphs, i.e., the problem of fi...
Includes bibliographical references (leaves 39-40).In the Planar Connected Face-Dominating Set probl...
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spannin...
We study the recently introduced \textscConnected Feedback Vertex Set (CFVS)} problem from the view-...
In this paper we consider the minimum feedback vertex set problem in graphs, i.e., the problem of fi...
We study the complexity of deciding whether for two given feedback vertex sets of a graph there is a...
The DOMINATING SET problem is one of the most widely studied problems in graph theory and networking...
A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from ever...
Many problems that are intractable for general graphs allow polynomial-time solutions for structured...
AbstractMany problems that are intractable for general graphs allow polynomial-time solutions for st...
In this paper, we consider the minimum feedback vertex set problem in graphs, i.e., the problem of f...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum ...
AbstractThe feedback vertex set problem for hypergraphs is considered and an efficient approximation...
In this paper we consider the minimum feedback vertex set problem in graphs, i.e., the problem of fi...
Includes bibliographical references (leaves 39-40).In the Planar Connected Face-Dominating Set probl...
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spannin...
We study the recently introduced \textscConnected Feedback Vertex Set (CFVS)} problem from the view-...
In this paper we consider the minimum feedback vertex set problem in graphs, i.e., the problem of fi...
We study the complexity of deciding whether for two given feedback vertex sets of a graph there is a...
The DOMINATING SET problem is one of the most widely studied problems in graph theory and networking...
A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from ever...
Many problems that are intractable for general graphs allow polynomial-time solutions for structured...
AbstractMany problems that are intractable for general graphs allow polynomial-time solutions for st...
In this paper, we consider the minimum feedback vertex set problem in graphs, i.e., the problem of f...
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and an...
We provide polynomial time data reduction rules for connected dominating set in planar graphs and an...