On the recognition of families of graphs with local computations

DOI10.1006/inco.1995.1056zbMath0827.68085OpenAlexW1976190666MaRDI QIDQ1891139

Igor Litovsky, Yves Métivier, Wiesław Zielonka

Publication date: 13 December 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1056

zbMATH Keywords

series-parallel graphslocal computations in graphs

Mathematics Subject Classification ID

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

Related Items (8)

Mobile Agents Implementing Local Computations in Graphs ⋮ Proving convergence of self-stabilizing systems using first-order rewriting and regular languages ⋮ Deciding and verifying network properties locally with few output bits ⋮ 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”. ⋮ Graph Relabelling Systems ⋮ Uniform election in trees and polyominoids ⋮ A self-stabilizing enumeration algorithm. ⋮ The Kronecker product and local computations in graphs

This page was built for publication: On the recognition of families of graphs with local computations