Proof labeling schemes for reachability-related problems in directed graphs
From MaRDI portal
Publication:2097332
DOI10.1007/978-3-031-09993-9_2OpenAlexW4285254199MaRDI QIDQ2097332
Orr Fischer, Yoav Ben Shimon, Rotem Oshman
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_2
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs
- Proof labeling schemes
- Survey of local algorithms
- Compact and localized distributed data structures
- Distributed broadcasting and mapping protocols in directed anonymous networks
- Local Distributed Decision
- On the Impact of Identifiers on Local Decision
This page was built for publication: Proof labeling schemes for reachability-related problems in directed graphs
