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

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

In this section we will show that graphs satisfying basic or extended acyclic redundancy can be transformed into a connectivity-preserving plane subgraph that ...

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

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

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.

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

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

Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. Request PDF. Open Access. Procedia Computer Science. Profile ...