Distributedly Testing Cycle-Freeness
From MaRDI portal
Publication:2945176
DOI10.1007/978-3-319-12340-0_2zbMath1417.68278OpenAlexW116607902MaRDI QIDQ2945176
Fabien Mathieu, Heger Arfaoui, David Ilcinkas, Pierre Fraigniaud
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12340-0_2
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (12)
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ⋮ Proof-labeling schemes: broadcast, unicast and in between ⋮ Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs ⋮ A hierarchy of local decision ⋮ Deciding and verifying network properties locally with few output bits ⋮ Randomized proof-labeling schemes ⋮ Unnamed Item ⋮ Redundancy in distributed proofs ⋮ Fast distributed algorithms for testing graph properties ⋮ Approximate proof-labeling schemes ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Introduction to local certification
This page was built for publication: Distributedly Testing Cycle-Freeness
