Sciweavers

966 search results - page 25 / 194
» Small Alliances in Graphs
Sort
View
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
11 years 11 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
APWEB
2008
Springer
13 years 10 months ago
The Layered World of Scientific Conferences
Recent models have introduced the notion of dimensions and hierarchies in social networks. These models motivate the mining of small world graphs under a new perspective. We exempl...
Michael Kuhn 0002, Roger Wattenhofer
ICPR
2002
IEEE
14 years 9 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan