Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

From MaRDI portal
Revision as of 19:48, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3448829

DOI10.1007/978-3-662-47672-7_58zbMath1410.05203arXiv1412.6466OpenAlexW1697536320MaRDI QIDQ3448829

Sebastian Krinninger, Veronika Loitzenbauer, Monika R. Henzinger

Publication date: 27 October 2015

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

Full work available at URL: https://arxiv.org/abs/1412.6466




Related Items (13)




Cites Work




This page was built for publication: Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time