Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently

DOI10.1007/978-3-030-04651-4_4OpenAlexW2900628670MaRDI QIDQ2327104

Luís Cunha, Fernanda Couto

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_4

zbMATH Keywords

split graphlower boundsthreshold graphcographprism graphtree \(t\)-spannerstretch indexcycle-power graphgeneralized octahedral graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs ⋮ Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes ⋮ Hardness and efficiency on minimizing maximum distances in spanning trees ⋮ Hardness and efficiency on \(t\)-admissibility for graph operations ⋮ Edge tree spanners

This page was built for publication: Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently