Distributed computation of coverage in sensor networks by homological methods
From MaRDI portal
Publication:714652
DOI10.1007/s00200-012-0167-7zbMath1300.55001OpenAlexW2116085985WikidataQ112198339 ScholiaQ112198339MaRDI QIDQ714652
Marian Mrozek, Robert W. Ghrist, Paweł Dłotko, Mateusz Juda
Publication date: 11 October 2012
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-012-0167-7
Software, source code, etc. for problems pertaining to algebraic topology (55-04) Polytopes and polyhedra (52B99) Homology and cohomology theories in algebraic topology (55N99)
Related Items
Allowing cycles in discrete Morse theory ⋮ The cubical cohomology ring: an algorithmic approach ⋮ Discrete Morse theoretic algorithms for computing homology of complexes and maps ⋮ Bayesian topological learning for classifying the structure of biological networks ⋮ Fast, Simple and Separable Computation of Betti Numbers on Three-Dimensional Cubical Complexes ⋮ A Bayesian Framework for Persistent Homology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Coreduction homology algorithm for inclusions and persistent homology
- Mayer-Vietoris sequences and coverage problems in sensor networks
- Vietoris-Rips complexes of planar point sets
- Coreduction homology algorithm
- Zigzag persistence
- Harmonic functions and boundary value problems on a chain complex
- Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
- Deterministic boundary recognition and topology extraction for large sensor networks
- A new distributed algorithm to find breadth first search trees
- Distributed Coverage Verification in Sensor Networks Without Location Information
- Local approximation schemes for topology control
- Asynchronous Logic Circuits and Sheaf Obstructions
- Zigzag persistent homology and real-valued functions
