A simple 3-edge connected component algorithm revisited

DOI10.1016/J.IPL.2013.09.010MaRDI QIDQ2350600zbMATH OpenOpenAlexFDO

Authors Nima Norouzi, Yung H. Tsin

Publication date 25 June 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.09.010

zbMATH Keywords

graph algorithms3-edge-connected components3-edge connectivity

Mathematics Subject Classification ID

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

Recommendations

• A simple 3-edge-connected component algorithm
• A simple randomized 3-edge connected component algorithm
• Yet another optimal algorithm for 3-edge-connectivity
• A simple certifying algorithm for 3-edge-connectivity
• A linear time algorithm for computing 3-edge-connected components in a multigraph

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• A linear time algorithm for computing 3-edge-connected components in a multigraph
• A simple 3-edge-connected component algorithm
• Algorithms for Placing Monitors in a Flow Network
• Depth-First Search and Linear Graph Algorithms
• PERFECT STOCHASTIC SUMMATION IN HIGH ORDER FEYNMAN GRAPH EXPANSIONS
• The Cluster Editing Problem: Implementations and Experiments
• Yet another optimal algorithm for 3-edge-connectivity

Cited in

(4)

• Yet another optimal algorithm for 3-edge-connectivity
• A simple randomized 3-edge connected component algorithm
• A simple certifying algorithm for 3-edge-connectivity
• A simple 3-edge-connected component algorithm

This page was built for publication: A simple 3-edge connected component algorithm revisited

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