scientific article; zbMATH DE number 177456

MaRDI QIDQ4037327zbMATH OpenFDO

Authors Igor Litovsky, Yves Métivier

Publication date 18 May 1993

zbMATH Keywords

distributed algorithmsgraphspriorityrecognizabilityrelabelling rules

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Computing with graph rewriting systems with priorities
• scientific article; zbMATH DE number 475415
• scientific article; zbMATH DE number 919838
• Different local controls for graph relabeling systems
• scientific article; zbMATH DE number 1026280

Cited in

(5)

• Computing with graph rewriting systems with priorities
• scientific article; zbMATH DE number 475415 (Why is no real title available?)
• Different local controls for graph relabeling systems
• scientific article; zbMATH DE number 1026280 (Why is no real title available?)
• Definitions and comparisons of local computations on graphs (extended abstract)

This page was built for publication:

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