scientific article; zbMATH DE number 140498

MaRDI QIDQ4028919zbMATH OpenFDO

Authors Mark A. Williams, David Fernández-Baca

Publication date 28 March 1993

zbMATH Keywords

augmentation problemsbipartite graphbottom-up methodbridge-connectivitycomplexityhierarchical graphpolynomial time algorithm

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Smallest bipartite bridge-connectivity augmentation
• Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
• Connectivity augmentation of graphs
• A minimum 3-connectivity augmentation of a graph
• A unifying augmentation algorithm for two-edge connectivity and biconnectivity

Cited in

(4)

• Algorithms for graph problems on BNLC structured garphs
• scientific article; zbMATH DE number 3858437 (Why is no real title available?)
• On matroids and hierarchical graphs
• On finding augmenting graphs

This page was built for publication:

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