A meta heuristic for graph drawing: learning the optimal graph-drawing method for clustered graphs

doi:10.1145/345513.345354

A meta heuristic for graph drawing: learning the optimal graph-drawing method for clustered graphs

Authors:	Oliver Niggemann
	Benno Stein

Published in:

· Proceeding

AVI '00 Proceedings of the working conference on Advanced visual interfaces

ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-252-2 doi>10.1145/345513.345354

	2000 Article
Bibliometrics
· Downloads (6 Weeks): n/a · Downloads (12 Months): n/a · Citation Count: 2

Tools and Resources

TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- AVI'12

Tags: algorithms clustering design display algorithms experimentation graph-drawing heuristic methods information-visualization learning measurement performance theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player