I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks

Degeneracy is an important concept to measure the sparsity of a graph which has been widely used in many network analysis applications. Many network analysis algorithms, such as clique enumeration and truss decomposition, perform very well in graphs having small degeneracies. In this paper, we propo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on knowledge and data engineering Ročník 34; číslo 7; s. 3335 - 3348
Hlavní autori:	Li, Rong-Hua, Song, Qiushuo, Xiao, Xiaokui, Qin, Lu, Wang, Guoren, Yu, Jeffrey Xu, Mao, Rui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> k</tex-math> <mml:math> <mml:mi>k</mml:mi> </mml:math> <inline-graphic xlink:href="wang-ieq3-3021484.gif" xlink:type="simple"/> </inline-formula>-core Algorithms Clustering algorithms Complexity theory Degeneracy Electronic mail Enumeration Graph theory Graphs Heuristic algorithms I/O-efficient algorithm massive graphs Memory management Network analysis Nodes Prediction algorithms Social network services
ISSN:	1041-4347, 1558-2191
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!