646 search results - page 23 / 130 » Generalized connected domination in graphs |
152
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
174
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
170
click to vote
ISAAC
2009
Springer
16 years 11 days ago
2009
Springer
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...
171
click to vote
FOCS
2009
IEEE
16 years 16 days ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
154
click to vote
IJRR
2000
15 years 5 months ago
2000
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...