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

This paper refers to a problem that covers wireless networking, local graph algorithms and geometric graphs. The purpose of local algorithms is to achieve a ...

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, ...

Example of an RCG graph, satisfying redundancy on the left and coexistence on the right. A graph satisfies the (proper) redundancy property (PR) if for all ...

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

Apr 25, 2024 · Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. LAGOS 2021: 108-117; 2020. [c2]. view.

Nov 29, 2023 · For graphs satisfying the redundancy and coexistence property the CP algorithm constructs a connected intersection-free subgraph G′ = (V,F). The ...

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

Connected plane graphs enable many local algorithmic solutions for data communication, task coordination and network maintenance in wireless sensor networks, ...