We present a local algorithm to construct such a connected plane graph. We prove algorithm correctness under redundancy and coexistence assumption.

In this work we develop the acyclic redundancy condition. This is a novel graph class with only one property that assures the existence of a connected plane ...

Missing: Coexistence | Show results with:Coexistence

We present a local algorithm to construct such a connected plane graph. We prove algorithm correctness under redundancy and coexistence assumption. Furthermore, ...

Abstract—Plane graphs play a major role for local routing and some other local network protocols in wireless communication. With such local algorithms each ...

This work studies graphs obeying redundancy and coexistence, and demonstrates that so far existing solutions cannot guarantee connectivity of the ...

In search of algorithms for constructing intersection-free subgraphs in wireless networks redundancy and coexistence have been identified as such properties.

We present a local algorithm to construct such a connected plane graph. We prove algorithm correctness under redundancy and coexistence assumption. Furthermore, ...

The concept means in general to construct the local view of nodes on a planar subgraph only when required with the least possible number of messages.

Publications that cite this publication. Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. Lucas Böltz ...

Nov 29, 2023 · ... Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. In: XI Latin and American. Algorithms ...