Certifying 3-edge-connectivity

DOI10.1007/S00453-015-0075-XMaRDI QIDQ6826718zbMATH OpenFDO

Authors K. Mehlhorn, Adrian Neumann, Jens M. Schmidt

Publication date 3 March 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-015-0075-X

zbMATH Keywords

certifying algorithmconstruction sequenceedge connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Cited in

(2)

• A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
• A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems

This page was built for publication: Certifying 3-edge-connectivity

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