𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity augmentation in planar straight line graphs

✍ Scribed by Csaba D. Tóth

Book ID
113582389
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
442 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-Connected Augmentation Problems in P
Two-Connected Augmentation Problems in Planar Graphs
✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi

Extremal graphs in connectivity augmenta
Extremal graphs in connectivity augmentation
✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
✍ Lin Woo 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the