Sciweavers

704 search results - page 80 / 141
» Isometrically Embedded Graphs
Sort
View
DLIB
2002
263views more  DLIB 2002»
14 years 11 months ago
Information Retrieval by Semantic Analysis and Visualization of the Concept Space of D-Lib Magazine
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
Junliang Zhang, Javed Mostafa, Himansu Tripathy
IPPS
2007
IEEE
15 years 6 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
ICALP
2010
Springer
15 years 4 months ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
CPC
2007
112views more  CPC 2007»
14 years 12 months ago
Graphs with Large Girth Not Embeddable in the Sphere
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
Pierre Charbit, Stéphan Thomassé
COMGEO
2004
ACM
14 years 11 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...