Algorithms for Drawing Clustered Graphs

@phdthesis{citeulike:356050, abstract = {In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics workstation as graph drawings. The usefulness of the relational model depends on whether the graph drawings effectively convey the relational information to the users. This thesis is concerned with...}, author = {Feng, Qingwen }, citeulike-article-id = {356050}, keywords = {graph, visualization}, posted-at = {2005-10-20 12:50:55}, priority = {4}, title = {Algorithms for Drawing Clustered Graphs}, url = {http://citeseer.ist.psu.edu/120437.html}, year = {1997} }

TY - THES ID - citeulike:356050 L3 - citeulike-article-id:356050 TI - Algorithms for Drawing Clustered Graphs N2 - In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics workstation as graph drawings. The usefulness of the relational model depends on whether the graph drawings effectively convey the relational information to the users. This thesis is concerned with... KW - graph KW - visualization AU - Feng, Qingwen PY - 1997/// UR - http://citeseer.ist.psu.edu/120437.html ER -