Locally computable enumerations

DOI10.1007/BFB0036171MaRDI QIDQ5055920zbMATH OpenOpenAlexFDO

Authors Antoni Mazurkiewicz

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0036171

zbMATH Keywords

distributed systemsgraphslocal computations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Distributed enumeration
• A self-stabilizing enumeration algorithm.
• Universal semi-local election protocol using forward links
• What Can be Computed Locally?
• Enumeration and leader election in partially anonymous and multi-hop broadcast networks

Cites work

• Coverings and minors: Application to local computations in graphs
• Distributed enumeration
• scientific article; zbMATH DE number 40998 (Why is no real title available?)
• scientific article; zbMATH DE number 512941 (Why is no real title available?)
• Solvability of the asynchronous ranking problem

Cited in

(4)

• A self-stabilizing enumeration algorithm.
• Distributed enumeration
• scientific article; zbMATH DE number 2079522 (Why is no real title available?)
• scientific article; zbMATH DE number 1453077 (Why is no real title available?)

This page was built for publication: Locally computable enumerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055920)