Augmenting the connectivity of geometric graphs
Authors:
- M. AbellanasMAM. Abellanas
- A. GarcíaAGA. García
- F. HurtadoFHF. Hurtado
- J. TejelJTJ. Tejel
- J. UrrutiaJUJ. Urrutia
- 1 August 2008
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 40 (3) , 220-230
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Encompassing colored planar straight line graphsComputational Geometry, 2008
- Independence free graphs and vertex connectivity augmentationJournal of Combinatorial Theory, Series B, 2005
- Competitive online routing in geometric graphsTheoretical Computer Science, 2004
- Alternating paths through disjoint line segmentsInformation Processing Letters, 2003
- Every Set of Disjoint Line Segments Admits a Binary TreeDiscrete & Computational Geometry, 2001
- Successive edge-connectivity augmentation problemsMathematical Programming, 1999
- Connectivity augmentation of networks: structures and algorithmsMathematical Programming, 1999
- Augmenting Outerplanar GraphsJournal of Algorithms, 1996
- On four-connecting a triconnected graph1992
- Augmentation ProblemsSIAM Journal on Computing, 1976