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

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

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 · ... Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. In: XI Latin and American. Algorithms ...

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

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

Constructing connected intersection-free graphs is a relevant building block for local algorithmic solutions for data communication, task coordination and ...