We develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-connected by adding a minimum number of new edges
For a finite ground set V, we call a set-function r: 2V → Z+ monotone, if r(X ′) ≥ r(X) holds for ea...
AbstractIt is shown that every k-edge-connected digraph with m edges and n vertices contains a spann...
AbstractFor designing reliable and efficient communications networks, the problem of constructing a ...
We develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-connected b...
AbstractWe develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-con...
We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one a...
AbstractWe derive a new min-max formula for the minimum number of new edges to be added to a given d...
AbstractTwo fundamental considerations in the design of a communications network are reliability and...
AbstractThis paper considers the problem of finding a minimum-cardinality set of edges for a given k...
In this paper, we present new incremental algorithms for maintaining data structures that represent ...
AbstractUsing the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augme...
This paper studies the behavior of the diameter and the average distance between vertices of the lin...
AbstractFor a given digraph G=(V,A) and a positive integer k, the k-vertex-connectivity unweighted a...
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
For a finite ground set V, we call a set-function r: 2V → Z+ monotone, if r(X ′) ≥ r(X) holds for ea...
AbstractIt is shown that every k-edge-connected digraph with m edges and n vertices contains a spann...
AbstractFor designing reliable and efficient communications networks, the problem of constructing a ...
We develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-connected b...
AbstractWe develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-con...
We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one a...
AbstractWe derive a new min-max formula for the minimum number of new edges to be added to a given d...
AbstractTwo fundamental considerations in the design of a communications network are reliability and...
AbstractThis paper considers the problem of finding a minimum-cardinality set of edges for a given k...
In this paper, we present new incremental algorithms for maintaining data structures that represent ...
AbstractUsing the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augme...
This paper studies the behavior of the diameter and the average distance between vertices of the lin...
AbstractFor a given digraph G=(V,A) and a positive integer k, the k-vertex-connectivity unweighted a...
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
For a finite ground set V, we call a set-function r: 2V → Z+ monotone, if r(X ′) ≥ r(X) holds for ea...
AbstractIt is shown that every k-edge-connected digraph with m edges and n vertices contains a spann...
AbstractFor designing reliable and efficient communications networks, the problem of constructing a ...
DOI
Add to ORKG