Augmenting Graphs to Minimize the Diameter
- 16 May 2014
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 72 (4) , 995-1010
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- The parametric complexity of graph diameter augmentationDiscrete Applied Mathematics, 2013
- Augmenting Graphs to Minimize the Diameter2013
- Improved approximability and non-approximability results for graph diameter decreasing problemsTheoretical Computer Science, 2012
- Parameterized Complexity and Approximation AlgorithmsThe Computer Journal, 2007
- Decreasing the diameter of cyclesJournal of Graph Theory, 2003
- Augmenting Trees to Meet Biconnectivity and Diameter ConstraintsAlgorithmica, 2002
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problemsOperations Research Letters, 1992
- Diameter increase caused by edge deletionJournal of Graph Theory, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987