Labeled versus unlabeled distributed Cayley networks
From MaRDI portal
Publication:1917232
DOI10.1016/0166-218X(94)00070-3zbMath0849.05035MaRDI QIDQ1917232
Danny Krizanc, Evangelos Kranakis
Publication date: 5 August 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Minimal sense of direction in regular networks ⋮ Computing on anonymous networks with sense of direction ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
Cites Work
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Uniform self-stabilizing ring orientation
- Vertex-transitive graphs
- Graphen mit transitiver Automorphismengruppe
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Computing on an anonymous ring
- A group-theoretic model for symmetric interconnection networks
- Network Orientation
- Computing functions on asynchronous anonymous networks
- On a Theorem of Sabidussi
- On recognizing a string on an anonymous ring
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Labeled versus unlabeled distributed Cayley networks
