The Kronecker product and local computations in graphs

DOI10.1007/3-540-61064-2_25MaRDI QIDQ5878897zbMATH OpenOpenAlexFDO

Authors Anne Bottreau, Yves Métivier

Publication date 23 February 2023

Published in Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61064-2_25

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Computing with graph rewriting systems with priorities
• Coverings and minors: Application to local computations in graphs
• Different local controls for graph relabeling systems
• Double covers of graphs
• Easy impossibility proofs for distributed consensus problems
• Finite common coverings of pairs of regular graphs
• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3355072 (Why is no real title available?)
• Kronecker Products and Local Joins of Graphs
• On the recognition of families of graphs with local computations
• The Categorical Product of Graphs
• The Kronecker Product of Graphs

Cited in

(2)

• Some remarks on the Kronecker product of graphs
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms

This page was built for publication: The Kronecker product and local computations in graphs

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