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, ...
Local Construction of Connected Plane Subgraphs in Graphs ...
researchr.org › publication › BoltzBF21
Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. Lucas Böltz, Benjamin Becker, Hannes Frey.
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 ...
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.
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 ...