Strong orientations of planar graphs with bounded stretch factor

DOI10.1007/978-3-642-13284-1_18MaRDI QIDQ3569128zbMATH OpenOpenAlexFDO

Authors Oscar Morales-Ponce, Ladislav Stacho, Evangelos Kranakis

Publication date 17 June 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13284-1_18

zbMATH Keywords

cut edgesdigraphdirectional antennaeplanarsensorsspannerstretch factorstrongly connected

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Strongly connected orientations of plane graphs
• Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
• Strong connectivity in sensor networks with given number of directional antennae of bounded angle
• Strong connectivity of sensor networks with double antennae
• Strong connectivity of sensor networks with double antennae

Cited in

(3)

• Planar orientations with low out-degree and compaction of adjacency matrices
• Strongly connected orientations of plane graphs
• On the Structure of the Strong Orientations of a Graph

This page was built for publication: Strong orientations of planar graphs with bounded stretch factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569128)