The minimum augmentation of a directed tree to ak-edge-connected directed graph

DOI10.1002/NET.3230160207MaRDI QIDQ3798671zbMATH OpenOpenAlexFDO

Authors Yoji Kajitani, Shuichi Ueno

Publication date 1986

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

directed graphdirected treeindeficiencyoutdeficiency

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• The minimum augmentation of any graph to aK-edge-connected graph
• Minimum augmentation of a tree to a K-edge-connected graph
• An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
• A 1-\((S,T)\)-edge-connectivity augmentation algorithm
• Directed vertex-connectivity augmentation

Cited in

(2)

• A bootstrap heuristic for designing minimum cost survivable networks
• The minimum augmentation of any graph to aK-edge-connected graph

This page was built for publication: The minimum augmentation of a directed tree to ak-edge-connected directed graph

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