Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

DOI10.1016/0020-0190(94)00229-RzbMath1004.68534OpenAlexW2063653207MaRDI QIDQ1349750

Ming-Yang Kao

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00229-r

zbMATH Keywords

combinatorial problemsanalysis of algorithmsdesign of algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Smallest bipartite bridge-connectivity augmentation ⋮ Optimal bi-level augmentation for selective! enhancing graph connectivity with applications ⋮ The bridge-connectivity augmentation problem with a partition constraint

Cites Work

• On the computational power of pushdown automata
• Unnamed Item
• Unnamed Item
• Unnamed Item