Strong Orientations of Planar Graphs with Bounded Stretch Factor
Abstract
We study the problem of orienting some edges of given planar graph such that the resulting subdigraph is strongly connected and spans all vertices of the graph. We are interested in orientations with minimum number of arcs and such that they produce a digraph with bounded stretch factor. Such orientations have applications into the problem of establishing strongly connected sensor network when sensors are equipped with directional antennae.
- Publication:
-
Lecture Notes in Computer Science
- Pub Date:
- 2010
- DOI:
- 10.1007/978-3-642-13284-1_18
- Bibcode:
- 2010LNCS.6058..224K