By Topic

On nearly symmetric drawings of graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ming-Che Chuang ; Comput. Centre, Acad. Sinica, Taipei, Taiwan ; Hsu-Chun Yen

We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowing the sequence of edge contractions sufficient for turning an asymmetric graph into a symmetric subgraph, our approach to symmetric drawing begins by drawing a graph's maximum symmetric subgraph using a force-directed method; the contracted edges are then re-inserted back into the drawing. By considering symmetry as the underlying aesthetic criterion, our algorithm provides better drawings than conventional spring algorithms, as our experimental results indicate.

Published in:

Information Visualisation, 2002. Proceedings. Sixth International Conference on

Date of Conference:

2002