Influence maximization on hypergraphs via multi-hop influence estimation

Gong, X Wang, H Wang, X Chen, C Zhang, W Zhang, Y

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Gong, X
dc.contributor.author	Wang, H
dc.contributor.author	Wang, X
dc.contributor.author	Chen, C
dc.contributor.author	Zhang, W
dc.contributor.author	Zhang, Y https://orcid.org/0000-0002-2674-1638
dc.date.accessioned	2024-03-01T02:51:09Z
dc.date.available	2024-03-01T02:51:09Z
dc.date.issued	2024-05
dc.identifier.citation	Information Processing & Management, 2024, 61, (3), pp. 103683
dc.identifier.issn	0020-0271
dc.identifier.uri	http://hdl.handle.net/10453/176012
dc.language	en
dc.publisher	Elsevier
dc.relation	http://purl.org/au-research/grants/arc/LP210301046
dc.relation	http://purl.org/au-research/grants/arc/DP230101445
dc.relation	http://purl.org/au-research/grants/arc/DP240101322
dc.relation.ispartof	Information Processing & Management
dc.relation.isbasedon	10.1016/j.ipm.2024.103683
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Influence maximization on hypergraphs via multi-hop influence estimation
dc.type	Journal Article
utslib.citation.volume	61
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-03-01T02:51:07Z
pubs.issue	3
pubs.publication-status	Accepted
pubs.volume	61
utslib.citation.issue	3

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