Back to Results
First PageMeta Content
Graph drawing / Force-based algorithms / Graph / Power graph analysis / Path decomposition / Graph theory / Mathematics / Theoretical computer science


Improved Circular Layouts Emden R. Gansner and Yehuda Koren AT&T Labs — Research Florham Park, NJ 07932, USA {erg,yehuda}@research.att.com Abstract. Circular graph layout is a drawing scheme where all nodes are placed
Add to Reading List

Document Date: 2012-02-16 11:23:45


Open Document

File Size: 203,37 KB

Share Result on Facebook

City

Sugiyama / Rome / /

Company

Yehuda Koren AT&T Labs / /

Currency

pence / /

/

IndustryTerm

digraph drawing algorithms / dynamic programming algorithm / social networks / hierarchical clustering algorithm / circular ordering algorithm / energy / /

ProgrammingLanguage

E / V / /

Technology

force-directed algorithms / bundling algorithm / hierarchical clustering algorithm / CIRCULAR algorithm / K-means algorithm / dynamic programming algorithm / Sugiyama-based digraph drawing algorithms / aforementioned CIRCULAR algorithm / circular ordering algorithm / evaluated algorithms / carried out using a dynamic programming algorithm / /

SocialTag