Optimal Mixed Graph Augmentation

DOI10.1137/0216041MaRDI QIDQ3762349zbMATH OpenOpenAlexFDO

Authors Dan Gusfield

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216041

zbMATH Keywords

augmentation problemgraph orientationmixed graphsstrong connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
• Smallest bipartite bridge-connectivity augmentation
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• Edge-augmentation of hypergraphs
• scientific article; zbMATH DE number 1757953

Cited in

(3)

• Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
• Optimal augmentation for bipartite componentwise biconnectivity in linear time
• Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication: Optimal Mixed Graph Augmentation

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