Sciweavers

326 search results - page 36 / 66
» A Library of Algorithms for Graph Drawing
Sort
View
GD
1999
Springer
15 years 1 months ago
Isomorphic Subgraphs
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
Sabine Bachl
KAIS
2007
121views more  KAIS 2007»
14 years 9 months ago
Node similarity in the citation graph
Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alo...
Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E...
JCDL
2009
ACM
127views Education» more  JCDL 2009»
15 years 4 months ago
Finding topic trends in digital libraries
We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the ge...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
15 years 3 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
INFOVIS
1997
IEEE
15 years 1 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner