Sciweavers

24 search results - page 1 / 5
» Augmenting the Connectivity of Planar and Geometric Graphs
Sort
View
ENDM
2008
142views more  ENDM 2008»
13 years 2 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
13 years 9 months ago
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...
Marwan Al-Jubeh, Mashhood Ishaque, Kristóf ...
COMGEO
2008
ACM
13 years 2 months ago
Augmenting the connectivity of geometric graphs
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
Manuel Abellanas, Alfredo García Olaverri, ...
DM
2010
126views more  DM 2010»
13 years 2 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale
CCCG
2010
13 years 3 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein