Minimum augmentation of a tree to a K-edge-connected graph

DOI10.1002/NET.3230180104MaRDI QIDQ3783316zbMATH OpenOpenAlexFDO

Authors Shuichi Ueno, Yoji Kajitani, Hajime Wada

Publication date 1988

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230180104

zbMATH Keywords

edge-connected graphminimum augmentationtree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• The minimum augmentation of any graph to aK-edge-connected graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• scientific article; zbMATH DE number 1617267
• \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs.
• On the maximum size of a minimal \(k\)-edge connected augmentation

Cited in

(4)

• A bootstrap heuristic for designing minimum cost survivable networks
• The minimum augmentation of a directed tree to ak-edge-connected directed graph
• The minimum augmentation of any graph to aK-edge-connected graph
• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

This page was built for publication: Minimum augmentation of a tree to a K-edge-connected graph

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