Labeled versus unlabeled distributed Cayley networks

DOI10.1016/0166-218X(94)00070-3zbMATH Open0849.05035MaRDI QIDQ1917232FDOQ1917232

Authors: Evangelos Kranakis, D. Krizanc 

Publication date: 5 August 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• Symmetries and sense of direction in labeled graphs
• Cayley graphs
• scientific article; zbMATH DE number 1151833
• Assigning labels in unknown anonymous networks (extended abstract)

zbMATH Keywords

labelingCayley graphBoolean functionslabelanonymous Cayley network

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Boolean functions (06E30)

Cites Work

• Computing on an anonymous ring
• A group-theoretic model for symmetric interconnection networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform self-stabilizing ring orientation
• Network Orientation
• Title not available (Why is that?)
• Vertex-transitive graphs
• Boolean Functions, Invariance Groups, and Parallel Complexity
• On a Theorem of Sabidussi
• Optimal lower bounds for some distributed algorithms for a complete network of processors
• Computing functions on asynchronous anonymous networks
• On recognizing a string on an anonymous ring
• Title not available (Why is that?)
• Graphen mit transitiver Automorphismengruppe
• Title not available (Why is that?)

Cited In (3)

• Computing on anonymous networks with sense of direction
• Minimal sense of direction in regular networks
• TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION

This page was built for publication: Labeled versus unlabeled distributed Cayley networks

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