Certifying 3-Connectivity in Linear Time

DOI10.1007/978-3-642-31594-7_66zbMath1272.05206OpenAlexW197905035MaRDI QIDQ2843301

Jens M. Schmidt

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_66

zbMATH Keywords

connected graphsconstruction method3 edge connectivity3 vertex connectivity3-connectivity test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

This page was built for publication: Certifying 3-Connectivity in Linear Time