Different local controls for graph relabeling systems

DOI10.1007/BF01294595MaRDI QIDQ4327379zbMATH OpenOpenAlexFDO

Authors Igor Litovsky, Éric Sopena, Yves Métivier

Publication date 5 April 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

distributed computations on graphsgraph relabeling systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Definitions and comparisons of local computations on graphs (extended abstract)
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• scientific article; zbMATH DE number 1026280
• scientific article; zbMATH DE number 177456
• Visualization of distributed algorithms based on graph relabelling systems

Cited in

(11)

• Sublinear fully distributed partition with applications
• Distributed graph traversals by relabelling systems with applications
• Mobile Agents Implementing Local Computations in Graphs
• scientific article; zbMATH DE number 177456 (Why is no real title available?)
• Checking Global Graph Properties by Means of Local Computations: the Majority Problem
• scientific article; zbMATH DE number 1026280 (Why is no real title available?)
• Visualization of distributed algorithms based on graph relabelling systems
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• Definitions and comparisons of local computations on graphs (extended abstract)
• Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
• The Kronecker product and local computations in graphs

This page was built for publication: Different local controls for graph relabeling systems

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