Diameter bounds for altered graphs
From MaRDI portal
Recommendations
Cited in
(44)- Diameter vulnerability of graphs by edge deletion
- Vertex fusion under distance constraints
- A new look at fault-tolerant network routing
- How robust is the n-cube?
- Large fault-tolerant interconnection networks
- Graphs with small diameter after edge deletion
- Generalized degrees and Menger path systems
- The minimum number of edges in a vertex diameter-2-critical graph
- Minimum cutsets in hypercubes
- Complexity and algorithms for constant diameter augmentation problems
- Almost optimal algorithms for diameter-optimally augmenting trees
- Reducing the diameter of a unit disk graph via node addition
- The impact of dynamic events on the number of errors in networks
- On large ( , D, D, 1)-graphs
- Some network topological notions of the Mycielskian of a graph
- scientific article; zbMATH DE number 5119227 (Why is no real title available?)
- Fast algorithms for diameter-optimally augmenting paths
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- Vertex fusion under diameter constraints
- scientific article; zbMATH DE number 4008432 (Why is no real title available?)
- Decreasing the diameter of bounded degree graphs
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- scientific article; zbMATH DE number 2157296 (Why is no real title available?)
- Decompositions into subgraphs of small diameter
- Some diameter notions in lexicographic product
- Some exact values for \(p(t,d)\)
- Minimum diameter and tF(f, q)
- Shortcutting directed and undirected networks with a degree constraint
- Almost optimal algorithms for diameter-optimally augmenting trees
- Some diameter notions of Fibonacci cubes
- Shortcuts for the circle
- Fast algorithms for diameter-optimally augmenting paths and trees
- The diameter variability of the Cartesian product of graphs
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Edge-fault diameter of C₄-free graphs
- Bounds on the fault-diameter of graphs
- The scaling limit of random cubic planar graphs
- Shortcuts for the circle
- Augmenting plane straight-line graphs to meet parity constraints
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Diameter vulnerability of graphs
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
This page was built for publication: Diameter bounds for altered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187315)
