Sciweavers

394 search results - page 36 / 79
» Testing subgraphs in large graphs
Sort
View
OTM
2010
Springer
13 years 7 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang
ECCB
2005
IEEE
14 years 2 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
13 years 7 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
DAC
1998
ACM
14 years 10 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
GD
2004
Springer
14 years 2 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu