Augmenting graphs to minimize the diameter

DOI10.1007/S00453-014-9886-4MaRDI QIDQ6826661zbMATH OpenFDO

Authors Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson

Publication date 2 September 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11590/286685

zbMATH Keywords

approximation algorithmsgraph algorithmsparametrized complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cited in

(3)

• Finding diameter-reducing shortcuts in trees
• Augmenting plane straight-line graphs to meet parity constraints
• Bicriteria approximation for minimum dilation graph augmentation

This page was built for publication: Augmenting graphs to minimize the diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826661)