FAST: FPGA-based Subgraph Matching on Massive Graphs.

Jin, X Yang, Z Lin, X Yang, S Qin, L

Peng, Y

Permalink

Open Access

Copyright Clearance Process

This item is open access.

The embargo period expires on 22 Jun 2023

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Jin, X
dc.contributor.author	Yang, Z
dc.contributor.author	Lin, X
dc.contributor.author	Yang, S
dc.contributor.author	Qin, L https://orcid.org/0000-0001-6068-5062
dc.contributor.author	Peng, Y
dc.date.accessioned	2022-01-31T04:31:37Z
dc.date.available	2022-01-31T04:31:37Z
dc.date.issued	2021
dc.identifier.citation	ICDE, 2021, pp. 1452-1463
dc.identifier.isbn	978-1-7281-9184-3
dc.identifier.uri	http://hdl.handle.net/10453/153939
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	ICDE
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.title	FAST: FPGA-based Subgraph Matching on Massive Graphs.
dc.type	Conference Proceeding
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	*
utslib.copyright.embargo	2023-06-22T00:00:00+1000Z
dc.date.updated	2022-01-31T04:31:36Z

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