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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	The VLDB journal Ročník 26; číslo 2; s. 275 - 300
Hlavní autori:	Yuan, Long, Qin, Lu, Lin, Xuemin, Chang, Lijun, Zhang, Wenjie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!