Sciweavers

721 search results - page 19 / 145
» Graphs with Large Obstacle Numbers
Sort
View
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 9 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 4 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
SENSYS
2003
ACM
14 years 2 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
TPDS
1998
110views more  TPDS 1998»
13 years 9 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
14 years 3 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...