Enumerating k-Vertex Connected Components in Large Graphs.

Wen, D Qin, L

Zhang, Y Chang, L Chen, L

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	Qin, L https://orcid.org/0000-0001-6068-5062
dc.contributor.author	Zhang, Y
dc.contributor.author	Chang, L
dc.contributor.author	Chen, L
dc.date.accessioned	2020-04-29T05:40:48Z
dc.date.available	2021-04-12T19:01:08Z
dc.date.issued	2019
dc.identifier.citation	ICDE, 2019, pp. 52-63
dc.identifier.isbn	978-1-5386-7474-1
dc.identifier.uri	http://hdl.handle.net/10453/140321
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	ICDE
dc.rights	© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.title	Enumerating k-Vertex Connected Components in Large Graphs.
dc.type	Conference Proceeding
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	open_access	*
dc.date.updated	2020-04-29T05:40:45Z
utslib.start-page	52

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