Filters








30,454 Hits in 5.1 sec

A comparison of vertex ordering algorithms for large graph visualization

C. Mueller, B. Martin, A. Lumsdaine
2007 2007 6th International Asia-Pacific Symposium on Visualization  
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices.  ...  We also provide a detailed discussion of the results for each algorithm across the different graph types and include a discussion of some strategies for using ordering algorithms for data analysis based  ...  ACKNOWLEDGMENTS This work was funded by a grant from the Lily Endowment. Doug Gregor provided support for the Boost Graph Library and its Python bindings.  ... 
doi:10.1109/apvis.2007.329289 dblp:conf/apvis/MuellerML07 fatcat:vmv4fgekmzajriawtw5xp3m7dy

New Approach of Bellman Ford Algorithm on GPU using Compute Unified Design Architecture (CUDA)

Pankhari Agarwal, Maitreyee Dutta
2015 International Journal of Computer Applications  
SSSP problem is a major problem in the graph theory that has various applications in real world that demand execution of these algorithms in large graphs having millions of edges and sequential implementation  ...  of these algorithms takes large amount of time.  ...  At present, the serial graph algorithms have reached the time limitation as they used to take a large amount of time.  ... 
doi:10.5120/19375-1027 fatcat:wnd3f4qyz5etposivhyujt546u

GViewer: GPU-Accelerated Graph Visualization and Mining [chapter]

Jianlong Zhong, Bingsheng He
2011 Lecture Notes in Computer Science  
There have been a number of tools developed for graph visualizations, e.g., Tulip, Gephi and GMine [8] .  ...  Additionally, we also perform a side-by-side comparison between the GPU-based algorithm and its CPU-based counterpart. (2) User interactions in GViewer to support graph visualization and mining.  ... 
doi:10.1007/978-3-642-24704-0_35 fatcat:ksqx67g4unhdpg7q6bc7dv42km

Drawing Graphs on a Smartphone

Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
2012 Journal of Graph Algorithms and Applications  
We present a system for the visualization of information modeled in terms of a graph on a smartphone.  ...  First, we show the adopted visualization paradigm, that allows the user to navigate the graph using a focus-based approach.  ...  Can the heuristics that we have presented for selecting a lobe be improved both from the point of view of the performance and from the point of view of the effectiveness?  ... 
doi:10.7155/jgaa.00252 fatcat:3ld6mh44ircjjmp7mbm7fza3hq

Drawing Graphs on a Smartphone [chapter]

Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia
2011 Lecture Notes in Computer Science  
We present a system for the visualization of information modeled in terms of a graph on a smartphone.  ...  First, we show the adopted visualization paradigm, that allows the user to navigate the graph using a focus-based approach.  ...  Can the heuristics that we have presented for selecting a lobe be improved both from the point of view of the performance and from the point of view of the effectiveness?  ... 
doi:10.1007/978-3-642-18469-7_14 fatcat:xiu4rglii5dovnazwhjszlyw5m

Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations

Vladimir Batagelj, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani
2010 2010 IEEE Pacific Visualization Symposium (PacificVis)  
Many different approaches have been proposed for the challenging problem of visually analyzing large networks. Clustering is one of the most promising.  ...  As a proof of concept, we describe the system VHYXY (Visual Hybrid (X,Y)-clustering) that implements our approach and we present the results of case studies to the visual analysis of social networks.  ...  ACKNOWLEDGEMENTS We thank the anonymous referees for their valuable comments.  ... 
doi:10.1109/pacificvis.2010.5429591 dblp:conf/apvis/BatageljDLPP10 fatcat:bktaglgrcvdsfdhllnjvw52j5u

Visual Analysis of Large Graphs Using (X,Y)-Clustering and Hybrid Visualizations

V. Batagelj, F. J. Brandenburg, W. Didimo, G. Liotta, P. Palladino, M. Patrignani
2011 IEEE Transactions on Visualization and Computer Graphics  
Many different approaches have been proposed for the challenging problem of visually analyzing large networks. Clustering is one of the most promising.  ...  As a proof of concept, we describe the system VHYXY (Visual Hybrid (X,Y)-clustering) that implements our approach and we present the results of case studies to the visual analysis of social networks.  ...  ACKNOWLEDGEMENTS We thank the anonymous referees for their valuable comments.  ... 
doi:10.1109/tvcg.2010.265 pmid:21173456 fatcat:fmffyj3uerddzcbh2ird5bmmou

Graph Sampling with Distributed In-Memory Dataflow Systems [article]

Kevin Gomez, Matthias Täschner, M. Ali Rostami, Christopher Rost, Erhard Rahm
2019 arXiv   pre-print
Given a large graph, a graph sample determines a subgraph with similar characteristics for certain metrics of the original graph.  ...  The samples are much smaller thereby accelerating and simplifying the analysis and visualization of large graphs.  ...  The second part will contain a more visual comparison of our sampling algorithms.  ... 
arXiv:1910.04493v1 fatcat:zypvsjk5s5a4vnlffmdclw7k4u

G-Space: a linear time graph layout

Brian Wylie, Jeffrey Baumes, Timothy M. Shead, Katy Börner, Matti T. Gröhn, Jinah Park, Jonathan C. Roberts
2008 Visualization and Data Analysis 2008  
The first phase is an embedding of the graph into a 2-D plane using geodesic distances as coordinates.  ...  We describe G-Space (Geodesic Space), a straightforward linear time layout algorithm that draws undirected graphs based purely on their topological features. The algorithm is divided into two phases.  ...  Sandia is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under Contract DE-AC04-94AL85000.  ... 
doi:10.1117/12.768012 dblp:conf/vda/WylieBS08 fatcat:4cux6tze6zbilgmrwrbxbmgx7y

Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph

Wu QUAN
2008 Journal of Software (Chinese)  
Marching-Graph is a new visualization that integrates the graph metaphor and the spatial metaphor into a single visualization.  ...  Thus, those force-directed layout algorithms can not satisfy the requirement for drawing a sequence of graphs rapidly, while the users are quickly marching through the geographic regions.  ...  instance of applying the above algorithm to a small graph G rooted at vertex "A".  ... 
doi:10.3724/sp.j.1001.2008.01920 fatcat:ws4qumwpn5bpxijjmhmx65s7ca

Mining scale-free networks using geodesic clustering

Andrew Y. Wu, Michael Garland, Jiawei Han
2004 Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '04  
Using this multilevel framework, we propose a new kind of graph clustering for data reduction of very large graph systems such as social, biological, or electronic networks.  ...  We describe a novel algorithm for clustering graphs based on graph geodesics (i.e., shortest paths).  ...  We also thank Mark Newman for the high energy theoretical physics publication data and Albert-Lázló Barabási for the protein-protein interaction data set.  ... 
doi:10.1145/1014052.1014146 dblp:conf/kdd/WuGH04 fatcat:63l33dxctjhhxdgi2jnco47d6y

Numerical integration methods and layout improvements in the context of dynamic RNA visualization

Boris Shabash, Kay C. Wiese
2017 BMC Bioinformatics  
Currently, jViz.RNA employs a unique method for the creation of the RNA molecule layout by mapping the RNA nucleotides into vertexes in a graph, which we call the detailed graph, and then utilizes a Newtonian  ...  RNA visualization software tools have traditionally presented a static visualization of RNA molecules with limited ability for users to interact with the resulting image once it is complete.  ...  Acknowledgements The authors would like to acknowledge feedback on the visualization aspects of the software received from Peter Unrau, Professor of Molecular Biology and Biochemistry, Simon Fraser University  ... 
doi:10.1186/s12859-017-1682-0 pmid:28558664 pmcid:PMC5450055 fatcat:vnjlfrohkjdmpndtvqlul3ikze

Overlapping Matrix Pattern Visualization: A Hypergraph Approach

Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan
2008 2008 Eighth IEEE International Conference on Data Mining  
We propose a novel iterative algorithm which utilize the existing graph ordering algorithm to solve the optimal visualization problem. This algorithm can always converge to a local minimum.  ...  In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to best display these submatrices  ...  Acknowledgments The authors would like to thank Ilya Safro for providing the Minimum Linear Arrangement source code and help on experimental setup.  ... 
doi:10.1109/icdm.2008.102 dblp:conf/icdm/JinXFD08 fatcat:zl6tysfskndi3j3fvyvy6uvp2e

How to Draw Graphs: Seeing and Redrafting Large Networks in Security and Biology [article]

Bob Blakley, G R Blakley, Sean M Blakley
2014 arXiv   pre-print
, logical, and visually clean place to put edge labels, and (iii) representations of large graphs are visually dense and difficult to interpret.  ...  A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices.  ...  Examples of algorithmic edge orderings of the large graph are the ordering by origin-vertex out-degree (Figure 7) , the ordering by destination-vertex in-degree (Figure 8) , and many others not illustrated  ... 
arXiv:1405.5523v1 fatcat:qgmav3ah6ja2zce7d3pgulbpvm

Labeled Object Treemap: A New Graph-Labeling Based Technique for Visualizing Multiple Hierarchies

Mahipal Jadeja, Rahul Muthu
2017 Annals of Pure and Applied Mathematics  
We propose a new technique of visualization namely 'Labeled Object Treemap' for the visualization of multiple hierarchies.  ...  the good characteristics of existing methods for visualizing multiple hierarchies.  ...  An example of a taxonomy is shown in Figure 1 . The treemap algorithm offers a practical way of displaying large trees (with millions of nodes) in limited space.  ... 
doi:10.22457/apam.v13n1a6 fatcat:v5343cdsqna4dppesk6tfhwuhe
« Previous Showing results 1 — 15 out of 30,454 results