scientific article; zbMATH DE number 512941
From MaRDI portal
Publication:4281656
zbMath0791.68131MaRDI QIDQ4281656
Igor Litovsky, Wiesław Zielonka, Yves Métivier
Publication date: 7 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
planar graphsseries parallel graphsgraph recognitionlocal computations on graphsrewriting systems over labelled graphssimulation of finite automata on words
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grammars and rewriting systems (68Q42)
Related Items (7)
Distributed enumeration ⋮ Locally computable enumerations ⋮ Different local controls for graph relabeling systems ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) ⋮ Generating irregular partitionable data structures ⋮ Checking Global Graph Properties by Means of Local Computations: the Majority Problem
This page was built for publication:
