1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2023★ 1 cited
A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
Yung H. Tsin
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contra…
cs.DS2023
On finding 2-cuts and 3-edge-connected components in parallel
Yung H. Tsin
Given a connected undirected multigraph G (a graph that may contain parallel edges), the algorithm of [19] finds the 3-edge-connected components of in linear time using an inno…
cs.DS2020★ 1 cited
A simple certifying algorithm for 3-edge-connectivity
Yung H. Tsin
A linear-time certifying algorithm for 3-edge-connectivity is presented. Given an undirected graph G, if G is 3-edge-connected, the algorithm generates a construction sequence as a…