Navigating Clustered Graphs using Force-Directed Methods

Eades, PD Huang, M

Permalink

Publisher:: World Scientific
Publication Type:: Journal Article
Citation:: Joiurnal of Graph Algorithms and Apoplications, 2004, 4 (3), pp. 191 - 216
Issue Date:: 2004-01

Closed Access

	Filename	Description	Size
	2005001554OK.pdf		5.28 MB	Adobe PDF	View/Open

Copyright Clearance Process

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Eades, PD	en_US
dc.contributor.author	Huang, M https://orcid.org/0000-0002-6896-6480	en_US
dc.date.issued	2004-01	en_US
dc.identifier.citation	Joiurnal of Graph Algorithms and Apoplications, 2004, 4 (3), pp. 191 - 216	en_US
dc.identifier.issn	1526-1719	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8293
dc.description.abstract	ISBN: 981-238-855-9	en_US
dc.publisher	World Scientific	en_US
dc.relation.ispartof	Joiurnal of Graph Algorithms and Apoplications	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Navigating Clustered Graphs using Force-Directed Methods	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	4	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	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 - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.issue	3	en_US
pubs.volume	4	en_US

Abstract:

ISBN: 981-238-855-9

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