Pages that link to "Item:Q5187315"
From MaRDI portal
The following pages link to Diameter bounds for altered graphs (Q5187315):
Displaying 37 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- Some network topological notions of the Mycielskian of a graph (Q322045) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Diameter vulnerability of graphs (Q800372) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
- Diameter vulnerability of graphs by edge deletion (Q1011748) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- A new look at fault-tolerant network routing (Q1099603) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- Generalized degrees and Menger path systems (Q1199423) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Minimum cutsets in hypercubes (Q1763354) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- On large (Δ, D, D, 1)-graphs (Q3087616) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Vertex fusion under diameter constraints (Q3503481) (← links)
- Decreasing the diameter of bounded degree graphs (Q4521485) (← links)
- The diameter vulnerability of the generalized Petersen graphGP[tk;k] (Q4633381) (← links)
- Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
- Some diameter notions in lexicographic product of graphs (Q5009987) (← links)
- Some exact values for <i>p</i>(<i>t</i><b>,</b> <i>d</i>) (Q5034539) (← links)
- Minimum diameter and <i>t<sub>F</sub></i>(<i>f, q</i>) (Q5035805) (← links)
- (Q5091032) (← links)
- Some diameter notions of Fibonacci cubes (Q5113050) (← links)
- (Q5136224) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
- THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS (Q5411795) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
- Edge-fault diameter of \(C_4\)-free graphs (Q6080136) (← links)
- Bounds on the fault-diameter of graphs (Q6496348) (← links)
