In this paper, we show that for outerplanar graphs G the problem of augmenting G by adding a minimum number of edges such that the augmented graph GЈ is planar and bridge-connected, biconnected, or triconnected can be solved in linear time and space. It is also shown that augmenting a biconnected ou
✦ LIBER ✦
Augmenting the Connectivity of Outerplanar Graphs
✍ Scribed by A. García; F. Hurtado; M. Noy; J. Tejel
- Book ID
- 106148895
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 586 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Augmenting Outerplanar Graphs
✍
Goos Kant
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 269 KB
Locating median paths on connected outer
✍
Isabella Lari; Federica Ricca; Andrea Scozzari; Ronald I. Becker
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 215 KB
👁 1 views
Connectivity Augmentation of Graphs
✍
Bill Jackson; Tibor Jordánn
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 230 KB
Augmenting the Edge Connectivity of Plan
✍
Marwan Al-Jubeh; Mashhood Ishaque; Kristóf Rédei; Diane L. Souvaine; Csaba D. Tó
📂
Article
📅
2011
🏛
Springer
🌐
English
⚖ 967 KB
The reconstruction of outerplanar graphs
✍
William B Giles
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 746 KB
👁 1 views
Characterizations of outerplanar graphs
✍
Maciej M. Sysło
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 750 KB
👁 1 views
The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem