𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on the Vertex-Connectivity Augmentation Problem

✍ Scribed by Tibor Jordán

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
297 KB
Volume
71
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on vertex pancyclic oriented grap
A note on vertex pancyclic oriented graphs
✍ Bang-Jensen, J�rgen; Guo, Yubao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

Let D be an oriented graph of order n ≥ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also

A Note on the Stockhausen Problem
A Note on the Stockhausen Problem
✍ Ronald C. Read; Lily Yen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We consider problems in the enumeration of sequences suggested by the problem of determining the number of ways of performing a piano composition (Klavierstu ck XI) by Karlheinz Stockhausen.

A note on vertex orders for stability nu
A note on vertex orders for stability number
✍ Mahadev, N. V. R.; Reed, B. A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previousl

A note on the tunneling time problem
A note on the tunneling time problem
✍ F.E Low; Paul F Mende 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A remarkable feature of barrier penetration in quantum theory is that a particle tunneling through a barrier appears to do so in zero time. We analyze the conditions that would make possible an actual measurement of an anomalously short traversal time and conclude that such a measurement cannot be m