Pages that link to "Item:Q1891139"

The following pages link to On the recognition of families of graphs with local computations (Q1891139):

Displaying 8 items.

• Uniform election in trees and polyominoids (Q708324) (← links)
• A self-stabilizing enumeration algorithm. (Q1853019) (← links)
• Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
• Mobile Agents Implementing Local Computations in Graphs (Q3540391) (← links)
• Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. (Q4921550) (← links)
• Graph Relabelling Systems (Q4923532) (← links)
• Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
• The Kronecker product and local computations in graphs (Q5878897) (← links)