Self-spanner graphs
From MaRDI portal
Publication:2565853
DOI10.1016/j.dam.2005.04.004zbMath1071.05029MaRDI QIDQ2565853
Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Publication date: 28 September 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.004
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Networks with small stretch number
- Distance-hereditary graphs
- Complement reducible graphs
- Parallel concepts in graph theory
- (\(k,+\))-distance-hereditary graphs
- Group Action Graphs and Parallel Architectures
- Graph spanners
- A Graph Model for Fault-Tolerant Computing Systems
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- On the Fault Tolerance of Some Popular Bounded-Degree Networks
- Graph Classes: A Survey
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults
- Fault-Tolerant Meshes with Small Degree
- An Optimal Synchronizer for the Hypercube
- The complexity of finding maximum disjoint paths with length constraints
- Spanners of Hypercube-Derived Networks
- Graphs with bounded induced distance
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Almost distance-hereditary graphs