Diameter increase caused by edge deletion
From MaRDI portal
Publication:3789599
DOI10.1002/jgt.3190110315zbMath0646.05038OpenAlexW2118748668WikidataQ59568120 ScholiaQ59568120MaRDI QIDQ3789599
Jan van Leeuwen, Anneke A. Schoone, Hans L. Bodlaender
Publication date: 1987
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16289
Related Items (47)
Some exact values for p(t, d) ⋮ Minimum diameter and tF(f, q) ⋮ Algorithms, Complexity, and Hans ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ On the principal eigenvectors of uniform hypergraphs ⋮ 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 ⋮ Graph classes with and without powers of bounded clique-width ⋮ Augmenting graphs to minimize the radius ⋮ On the stability of the principal ratio ⋮ Finding diameter-reducing shortcuts in trees ⋮ Minimizing the continuous diameter when augmenting a geometric tree with a shortcut ⋮ Fractals for Kernelization Lower Bounds ⋮ The parametric complexity of graph diameter augmentation ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Minimum Violation Vertex Maps and Their Applications to Cut Problems ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ The Optimal Design of Low-Latency Virtual Backbones ⋮ Augmenting graphs to minimize the diameter ⋮ Shortcuts for the circle ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Minimum cutsets in hypercubes ⋮ Decreasing the diameter of bounded degree graphs ⋮ Deterministic Models of Communication Faults ⋮ An improved algorithm for diameter-optimally augmenting paths in a metric space ⋮ Unnamed Item ⋮ Augmenting forests to meet odd diameter requirements ⋮ A linear-time algorithm for radius-optimally augmenting paths in a metric space ⋮ Mixed covering of trees and the augmentation problem with odd diameter constraints ⋮ Diameter vulnerability of graphs by edge deletion ⋮ 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 ⋮ Mathematical programming models for some smallest-world problems ⋮ Some diameter notions in lexicographic product of graphs ⋮ A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ Reducing the diameter of a unit disk graph via node addition
Cites Work
This page was built for publication: Diameter increase caused by edge deletion
