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

DOI10.1016/0020-0190(94)00229-RMaRDI QIDQ1349750zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmscombinatorial problemsdesign of algorithms

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3915608 (Why is no real title available?)
• scientific article; zbMATH DE number 108389 (Why is no real title available?)
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• On the computational power of pushdown automata

Cited in

(4)

• Smallest bipartite bridge-connectivity augmentation
• The bridge-connectivity augmentation problem with a partition constraint
• Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
• Optimal augmentation for bipartite componentwise biconnectivity in linear time

This page was built for publication: Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

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