Sciweavers

942 search results - page 62 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 3 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
APWEB
2005
Springer
14 years 2 months ago
An LOD Model for Graph Visualization and Its Application in Web Navigation
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
Shixia Liu, Yue Pan, Liping Yang, Wenyin Liu
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 7 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
WWW
2004
ACM
14 years 9 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 10 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz