I/O efficient ECC graph decomposition via graph reduction

The problem of computing k -edge connected components ( k - ECC s) of a graph G for a specific k is a fundamental graph problem and has been investigated recently. In this paper, we study the problem of ECC decomposition, which computes the k - ECC s of a graph G for all possible k values. ECC decom...

Full description

Saved in:

Bibliographic Details
Published in:	The VLDB journal Vol. 26; no. 2; pp. 275 - 300
Main Authors:	Yuan, Long, Qin, Lu, Lin, Xuemin, Chang, Lijun, Zhang, Wenjie
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2017 Springer Nature B.V
Subjects:	Algorithms Computation Computer memory Computer Science Cost analysis Data structures Database Management Decomposition Graph theory Input output analysis Regular Paper Searching Tillage I/O efficient algorithm Graph Edge connected component decomposition
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!