Minimal sense of direction in regular networks
From MaRDI portal
(Redirected from Publication:290224)
Recommendations
Cites work
- A group-theoretic model for symmetric interconnection networks
- An improved election algorithm in chordal ring networks
- Computing on an anonymous ring
- Distributed computing on transitive networks: the torus
- Efficient elections in chordal ring networks
- Hamiltonian decomposition of Cayley graphs of degree 4
- Labeled versus unlabeled distributed Cayley networks
- Network Orientation
- New methods for using Cayley graphs in interconnection networks
- Processor interconnection networks from Cayley graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Towards optimal distributed election on chordal rings
- Uniform self-stabilizing ring orientation
Cited in
(11)- Coverings that preserve sense of direction
- Minimal sense of direction and decision problems for Cayley graphs
- Sense of direction: Definitions, properties, and classes
- Lower bounds for sense of direction in regular graphs
- scientific article; zbMATH DE number 1696678 (Why is no real title available?)
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- Weak sense of direction labelings and graph embeddings
- Symmetries and sense of direction in labeled graphs
- Minimal Chordal Sense of Direction and Circulant Graphs
- Sense of direction in distributed computing
- Feasibility in transportation networks with supply eating arcs
This page was built for publication: Minimal sense of direction in regular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290224)