Add to ORKGWe answer the following question: what is the minimum number of edges of a 2-connected graph with a given diameter. This problem stems from survivable telecommunication network design with grade of service constraints. In this arti-cle we prove tight bounds for 2-connected graphs and for 2-edge-connected graphs. The bound for 2-connected graphs was a conjecture of Bollobás (1968 AMH 75-80)
We give a 17 12 -approximation algorithm for the following NP-hard problem: Given an undirected gra...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
AbstractTwo fundamental considerations in the design of a communications network are reliability and...
AbstractWe answer the following question: what is the minimum number of edges of a 2-connected graph...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
The problem of finding the minimum size 2-connected subgraph is a classical problem in network desig...
AbstractThe problem of finding the minimum size 2-connected subgraph is a classical problem in netwo...
A graph is said to be 2-edge-connected if it remains connected after the deletion of any single edge...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractFor a connected graph G the restricted edge-connectivity λ′(G) is defined as the minimum car...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected...
We consider the problem of finding the minimum 2-vertex connected spanning subgraph in a given graph...
We give a 17 12 -approximation algorithm for the following NP-hard problem: Given an undirected gra...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
AbstractTwo fundamental considerations in the design of a communications network are reliability and...
AbstractWe answer the following question: what is the minimum number of edges of a 2-connected graph...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
The problem of finding the minimum size 2-connected subgraph is a classical problem in network desig...
AbstractThe problem of finding the minimum size 2-connected subgraph is a classical problem in netwo...
A graph is said to be 2-edge-connected if it remains connected after the deletion of any single edge...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractFor a connected graph G the restricted edge-connectivity λ′(G) is defined as the minimum car...
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases ...
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected...
We consider the problem of finding the minimum 2-vertex connected spanning subgraph in a given graph...
We give a 17 12 -approximation algorithm for the following NP-hard problem: Given an undirected gra...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
AbstractTwo fundamental considerations in the design of a communications network are reliability and...