Self-spanner graphs
From MaRDI portal
Publication:2565853
Recommendations
Cites work
- (k,+)-distance-hereditary graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Graph Model for Fault-Tolerant Computing Systems
- Almost distance-hereditary graphs
- An Optimal Synchronizer for the Hypercube
- Complement reducible graphs
- Distance-hereditary graphs
- Fault-Tolerant Meshes with Small Degree
- Graph Classes: A Survey
- Graph spanners
- Graphs with bounded induced distance
- Group Action Graphs and Parallel Architectures
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1522931 (Why is no real title available?)
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Networks with small stretch number
- On the Fault Tolerance of Some Popular Bounded-Degree Networks
- Parallel concepts in graph theory
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults
- Spanners of Hypercube-Derived Networks
- The complexity of finding maximum disjoint paths with length constraints
Cited in
(9)- Minimum self-repairing graphs
- Spatio-spectral limiting on discrete tori: adjacency invariant spaces
- scientific article; zbMATH DE number 1696525 (Why is no real title available?)
- Spanders: distributed spanning expanders
- scientific article; zbMATH DE number 2038887 (Why is no real title available?)
- scientific article; zbMATH DE number 1522931 (Why is no real title available?)
- scientific article; zbMATH DE number 841614 (Why is no real title available?)
- Self-stabilizing metric graphs
- Networks with small stretch number
This page was built for publication: Self-spanner graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565853)