K-connected cores computation in large dual networks

Yue, L; Wen, D; Cui, L; Qin, L; Zheng, Y

K-connected cores computation in large dual networks

Yue, L Wen, D

Cui, L Qin, L

Zheng, Y

Permalink

Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, 10827 LNCS pp. 169 - 186
Issue Date:: 2018-01-01

Closed Access

	Filename	Description	Size
	Conference paper.pdf	Published Version	885.12 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yue, L	en_US
dc.contributor.author	Wen, D https://orcid.org/0000-0002-0903-1503	en_US
dc.contributor.author	Cui, L	en_US
dc.contributor.author	Qin, L https://orcid.org/0000-0001-6068-5062	en_US
dc.contributor.author	Zheng, Y	en_US
dc.date.issued	2018-01-01	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, 10827 LNCS pp. 169 - 186	en_US
dc.identifier.isbn	9783319914510	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131189
dc.description.abstract	© Springer International Publishing AG, part of Springer Nature 2018. Computing k-cores is a fundamental and important graph problem, which can be applied in many areas, such as community detection, network visualization, and network topology analysis. Due to the complex relationship between different entities, dual graph widely exists in the applications. A dual graph contains a physical graph and a conceptual graph, both of which have the same vertex set. Given that there exist no previous studies on the k-core in dual graphs, we formulate a k-connected core (k-CCO) model in dual graphs. A k-CCO is a k-core in the conceptual graph, and also connected in the physical graph. Given a dual graph and an integer k, we propose a polynomial time algorithm for computing all k-CCOs. We also propose three algorithms for computing all maximum-connected cores (MCCO), which are the existing k-CCOs such that a (k +1)-CCO does not exist. We conduct extensive experiments on six real-world datasets and several synthetic datasets. The experimental results demonstrate the effectiveness and efficiency of our proposed algorithms.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-319-91452-7_12	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	K-connected cores computation in large dual networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	10827 LNCS	en_US
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
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/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	10827 LNCS	en_US

Abstract:

© Springer International Publishing AG, part of Springer Nature 2018. Computing k-cores is a fundamental and important graph problem, which can be applied in many areas, such as community detection, network visualization, and network topology analysis. Due to the complex relationship between different entities, dual graph widely exists in the applications. A dual graph contains a physical graph and a conceptual graph, both of which have the same vertex set. Given that there exist no previous studies on the k-core in dual graphs, we formulate a k-connected core (k-CCO) model in dual graphs. A k-CCO is a k-core in the conceptual graph, and also connected in the physical graph. Given a dual graph and an integer k, we propose a polynomial time algorithm for computing all k-CCOs. We also propose three algorithms for computing all maximum-connected cores (MCCO), which are the existing k-CCOs such that a (k +1)-CCO does not exist. We conduct extensive experiments on six real-world datasets and several synthetic datasets. The experimental results demonstrate the effectiveness and efficiency of our proposed algorithms.

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

http://hdl.handle.net/10453/131189