An Efficient Algorithm for a Sparse k-Edge-Connectivity Certificate

DOI10.1006/JAGM.2000.1144zbMath0974.68151OpenAlexW2060397273MaRDI QIDQ2729643

Hiroshi Nagamochi, Toru Hasunuma

Publication date: 23 July 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1144

zbMATH Keywords

graph algorithmsspanning forests\(k\)-edge-connectivity certificate

Mathematics Subject Classification ID

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

This page was built for publication: An Efficient Algorithm for a Sparse k-Edge-Connectivity Certificate