Improved Linear-Time Algorithm for Computing the $4$-Edge-Connected Components of a Graph

Loukas Georgiadis,Giuseppe F. Italiano,Evangelos Kosinas

arxiv（2021）

引用 0|浏览0

暂无评分

摘要

We present an improved algorithm for computing the $4$-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer machine model of computation.

查看译文

关键词

graph,algorithm,linear-time,edge-connected

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要