Add to ORKGon rvv iIf neceswiy ard identify by block number) FIELD GROUP SUB-GROUP directed graphs, graph algorithms, PRAM algorithms, I directed spanning trees. 19. ABSTRACT (Caon on orewr Wf necemy and identify by block numfb,) We study the following problem: given a strongly connected digraph, find a minimal strongly connected spanning subgraph of it. Oa r main result is a paralll---algorithm for this problem, which runs in polylog parallel time and uses 0(n3) pro
AbstractWe study the complexity of the problem of deciding the existence of a spanning subgraph of a...
Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G wit...
International audienceThe problems of determining minimum identifying, locating-dominating or open l...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that ha...
Strongly connected components of a directed graph can be found in an optimal linear time, by algorit...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
Strongly connected components of a directed graph can be found in an optimal linear time, by algori...
Let G be a strongly connected directed graph. We consider the problem of computing the smallest stro...
We initiate the study of the problem of designing sublinear-time (local) algorithms that, given an e...
Abstract. We present an optimal deterministic O(n)-work parallel algo-rithm for finding a minimum sp...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
Let G be a strongly connected directed graph. We consider the following three problems, where we wis...
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by...
We propose an O(min{m+nlogn,mlog∗n}) to find a minmax strongly connected spanningsubgraph of a digra...
AbstractWe study the complexity of the problem of deciding the existence of a spanning subgraph of a...
Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G wit...
International audienceThe problems of determining minimum identifying, locating-dominating or open l...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that ha...
Strongly connected components of a directed graph can be found in an optimal linear time, by algorit...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
Strongly connected components of a directed graph can be found in an optimal linear time, by algori...
Let G be a strongly connected directed graph. We consider the problem of computing the smallest stro...
We initiate the study of the problem of designing sublinear-time (local) algorithms that, given an e...
Abstract. We present an optimal deterministic O(n)-work parallel algo-rithm for finding a minimum sp...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
Let G be a strongly connected directed graph. We consider the following three problems, where we wis...
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by...
We propose an O(min{m+nlogn,mlog∗n}) to find a minmax strongly connected spanningsubgraph of a digra...
AbstractWe study the complexity of the problem of deciding the existence of a spanning subgraph of a...
Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G wit...
International audienceThe problems of determining minimum identifying, locating-dominating or open l...