Add to ORKGWe propose an O(min{m+nlogn,mlog∗n}) to find a minmax strongly connected spanningsubgraph of a digraph with n nodes and m arcs. A generalization of this problemcalled theminmax strongly connected subgraph problem with node penalties is also considered.An O(mlogn) algorithm is proposed to solve this general problem. We also discussways to improve the average complexity of this algorithm
AbstractAssume that G(V,E) is a weighted, undirected, connected graph with n vertices. The k most vi...
Given a graph G = (V, E), the maximum leaf spanning tree problem (MLSTP) is to find a spanning tree ...
The MEG (minimum equivalent graph) problem is "Given a directed graph, find a smallest subset of th...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
An out-tree T of a directed graph D is a rooted tree subgraph with all arcs directed outwards from t...
AbstractWe study the complexity of the problem of deciding the existence of a spanning subgraph of a...
We survey approximation algorithms of connectivity problems. The survey presented describing various...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractGiven a (directed or undirected) graph with edge costs, the power of a node is the maximum c...
We study the complexity of the problem of deciding the existence of a spanning subgraph of a given g...
AbstractLet G=(V,E) be a connected graph such that edges and vertices are weighted by nonnegative re...
The main result of this paper is motivated by the following two apparently unrelated graph optimizat...
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum s-t cut (or just it...
In a directed graph G=(V,E) with a capacity on every edge, a bottleneck path (or widest path) betwee...
AbstractGiven a (directed) graph with costs on the edges, the power of a node is the maximum cost of...
AbstractAssume that G(V,E) is a weighted, undirected, connected graph with n vertices. The k most vi...
Given a graph G = (V, E), the maximum leaf spanning tree problem (MLSTP) is to find a spanning tree ...
The MEG (minimum equivalent graph) problem is "Given a directed graph, find a smallest subset of th...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
An out-tree T of a directed graph D is a rooted tree subgraph with all arcs directed outwards from t...
AbstractWe study the complexity of the problem of deciding the existence of a spanning subgraph of a...
We survey approximation algorithms of connectivity problems. The survey presented describing various...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractGiven a (directed or undirected) graph with edge costs, the power of a node is the maximum c...
We study the complexity of the problem of deciding the existence of a spanning subgraph of a given g...
AbstractLet G=(V,E) be a connected graph such that edges and vertices are weighted by nonnegative re...
The main result of this paper is motivated by the following two apparently unrelated graph optimizat...
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum s-t cut (or just it...
In a directed graph G=(V,E) with a capacity on every edge, a bottleneck path (or widest path) betwee...
AbstractGiven a (directed) graph with costs on the edges, the power of a node is the maximum cost of...
AbstractAssume that G(V,E) is a weighted, undirected, connected graph with n vertices. The k most vi...
Given a graph G = (V, E), the maximum leaf spanning tree problem (MLSTP) is to find a spanning tree ...
The MEG (minimum equivalent graph) problem is "Given a directed graph, find a smallest subset of th...