Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.

Wen, D Yang, B Qin, L

Zhang, Y Chang, L Li, R-H

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Wen, D
dc.contributor.author	Yang, B
dc.contributor.author	Qin, L https://orcid.org/0000-0001-6068-5062
dc.contributor.author	Zhang, Y
dc.contributor.author	Chang, L
dc.contributor.author	Li, R-H
dc.date.accessioned	2024-02-06T11:26:37Z
dc.date.available	2024-02-06T11:26:37Z
dc.date.issued	2022
dc.identifier.citation	IEEE Trans. Knowl. Data Eng., 2022, 34, pp. 3126-3138
dc.identifier.uri	http://hdl.handle.net/10453/175389
dc.language	en
dc.relation.ispartof	IEEE Trans. Knowl. Data Eng.
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.
dc.type	Journal Article
utslib.citation.volume	34
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Strength - AAII - Australian Artificial Intelligence Institute
utslib.copyright.status	open_access	*
dc.date.updated	2024-02-06T11:26:36Z
pubs.volume	34

Please use this identifier to cite or link to this item: