Survey on Graph-Hierarchy Visualization Techniques
Akshata D. Deore, Prof R. L. Paikrao
Abstract
Akshata D. Deore, Prof R. L. Paikrao
Abstract
Abstract — A graph is now widely used in many real time applications. These applications require displaying graphs using computers. Small graphs can be easily displayed on screen. But graphs with much number of nodes and connecting edges are difficult to display. These graphs when arranged in a hierarchical structure are called as Tree. Visualization of this graph hierarchy is an important issue. This paper presents information about visualizing graphs using computers and a survey on graph hierarchy visualization technique. Two techniques are explained; Node-Link technique and Space-Filling technique.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract — A graph is now widely used in many real time applications. These applications require displaying graphs using computers. Small graphs can be easily displayed on screen. But graphs with much number of nodes and connecting edges are difficult to display. These graphs when arranged in a hierarchical structure are called as Tree. Visualization of this graph hierarchy is an important issue. This paper presents information about visualizing graphs using computers and a survey on graph hierarchy visualization technique. Two techniques are explained; Node-Link technique and Space-Filling technique.
Key concepts: Computer science, Visualization, Graph drawing, Theoretical computer science, Hierarchy, Graph, Graph product, Data visualization