Diameter bounds for altered graphs

From MaRDI portal
Publication:5187315

DOI10.1002/jgt.3190080408zbMath0562.05030OpenAlexW2014447809MaRDI QIDQ5187315

Michael R. Garey, Fan R. K. Chung

Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080408



Related Items

The impact of dynamic events on the number of errors in networks, Some exact values for p(t, d), Minimum diameter and tF(f, q), Fast Algorithms for Diameter-Optimally Augmenting Paths, A new look at fault-tolerant network routing, Some network topological notions of the Mycielskian of a graph, The minimum number of edges in a vertex diameter-2-critical graph, How robust is the n-cube?, Almost optimal algorithms for diameter-optimally augmenting trees, Large fault-tolerant interconnection networks, Edge-fault diameter of \(C_4\)-free graphs, Vertex fusion under diameter constraints, Some diameter notions of Fibonacci cubes, Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees, Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length, The diameter vulnerability of the generalized Petersen graphGP[tk;k], Shortcuts for the circle, Shortcutting directed and undirected networks with a degree constraint, Decompositions into Subgraphs of Small Diameter, Graphs with small diameter after edge deletion, Generalized degrees and Menger path systems, THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, Minimum cutsets in hypercubes, Decreasing the diameter of bounded degree graphs, Unnamed Item, Diameter vulnerability of graphs by edge deletion, On large (Δ, D, D, 1)-graphs, Improved approximability and non-approximability results for graph diameter decreasing problems, Unnamed Item, Complexity and algorithms for constant diameter augmentation problems, Vertex fusion under distance constraints, Some diameter notions in lexicographic product of graphs, Diameter vulnerability of graphs, Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees, Reducing the diameter of a unit disk graph via node addition