Distributed Coverage Verification in Sensor Networks Without Location Information
From MaRDI portal
Cited in
(20)- Non total-unimodularity neutralized simplicial complexes
- Centralities in simplicial complexes. Applications to protein interaction networks
- Path homology theory of multigraphs and quivers
- Existence and uniqueness of solutions to the norm minimum problem on digraphs
- Path complexes and their homologies
- Algebraic topological characterizations of structural balance in signed graphs
- A topological measurement of protein compressibility
- Spectra of combinatorial Laplace operators on simplicial complexes
- Volume-optimal cycle: tightest representative cycle of a generator in persistent homology
- Signal Processing on Simplicial Complexes
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Hodge Laplacians on graphs
- Stable volumes for persistent homology
- What Are Higher-Order Networks?
- A Spatial Logic for Simplicial Models
- Statistical ranking and combinatorial Hodge theory
- A simplicial homology approach for assessing and rectifying coverage of sensor networks for improved crop management
- Distributed computation of coverage in sensor networks by homological methods
- Topological \(k\)-metrics
- Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape
This page was built for publication: Distributed Coverage Verification in Sensor Networks Without Location Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978902)