A Simple Algorithm for Finding All k-Edge-Connected Components

Open Access

Peer-reviewed

Research Article

Tianhao Wang,

Affiliation Software School, Fudan University, Shanghai, China
⨯
Yong Zhang ,

* E-mail: yzhang.hku@gmail.com

Affiliations Research Center for High Performance Computing, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China, College of Mathematics and Information Science, Hebei University, Baoding, China
⨯
Francis Y. L. Chin,

Affiliations Department of Computer Science, The University of Hong Kong, Hong Kong, China, Hang Seng Management College, Hong Kong, China
⨯
Hing-Fung Ting,

Affiliation Department of Computer Science, The University of Hong Kong, Hong Kong, China
⨯
Yung H. Tsin,

Affiliation School of Computer Science, University of Windsor, Windsor, Canada
⨯
Sheung-Hung Poon

Affiliation School of Computing and Informatics, Institut Teknologi Brunei, Gadong, Brunei Darussalam
⨯

Reader Comments (0)

Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Directed graphs
Is the Subject Area "Directed graphs" applicable to this article?

Thanks for your feedback.
Forests
Is the Subject Area "Forests" applicable to this article?

Thanks for your feedback.
Preprocessing
Is the Subject Area "Preprocessing" applicable to this article?

Thanks for your feedback.
Computer and information sciences
Is the Subject Area "Computer and information sciences" applicable to this article?

Thanks for your feedback.
Social networks
Is the Subject Area "Social networks" applicable to this article?

Thanks for your feedback.
Body weight
Is the Subject Area "Body weight" applicable to this article?

Thanks for your feedback.
Reliability
Is the Subject Area "Reliability" applicable to this article?

Thanks for your feedback.