We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs using extracted spanning trees, and a graph animation algorithm for creating smooth, continuous transitions between graph drawings. We conduct experiments to measure how well our algorithms visualize graphs and compare them to another visualization scheme.
Library of Congress Subject Headings
Computer graphics; Graph theory--data processing
Department, Program, or Center
Computer Science (GCCIS)
Pavlo, Andrew, "Interactive, tree-based graph visualization" (2006). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus