Yet another optimal algorithm for 3-edge-connectivity
From MaRDI portal
Publication:1013081
DOI10.1016/j.jda.2008.04.003zbMath1168.68613MaRDI QIDQ1013081
Publication date: 16 April 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.04.003
analysis of algorithms; graph connectivity; depth-first search; edge-connectivity; 3-edge-connected graph; 3-edge-connected component; cut-pair
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science