✦ LIBER ✦

On the Optimal Vertex-Connectivity Augmentation

✍ Scribed by T. Jordan

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 568 KB
Volume: 63
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on the Vertex-Connectivity Augmen

A Note on the Vertex-Connectivity Augmentation Problem

✍ Tibor Jordán 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 297 KB

NOTE Improved Approximation Algorithms f

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan

On uniformly optimally reliable graphs f

On uniformly optimally reliable graphs for pair-connected reliability with vertex failures

✍ A. T. Amin; K. T. Siegrist; P. J. Slater 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 706 KB

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is

On locally optimal independent sets and

On locally optimal independent sets and vertex covers

✍ Gang Yu; Olivier Goldschmidt 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

In this paper, we introduce a new notion of local optimality and demonstrate its application to the problem of finding optimal independent sets and vertex covers in k-claw free graphs. The maximum independent set problem in k-claw free graphs has interesting applications in the design of electronic

Some remarks on Arc-connectivity, vertex

Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs

✍ Bill Jackson 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio