Sciweavers

2304 search results - page 12 / 461
» On the Vulnerability of Large Graphs
Sort
View
IV
2005
IEEE
131views Visualization» more  IV 2005»
14 years 3 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
GD
1999
Springer
14 years 1 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
IVS
2008
81views more  IVS 2008»
13 years 9 months ago
A dynamic multiscale magnifying tool for exploring large sparse graphs
We present an information visualization tool, known as GreenMax, to visually explore large small-world graphs with up to a million graph nodes on a desktop computer. A major motiv...
Pak Chung Wong, Harlan Foote, Patrick Mackey, Geor...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 9 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu