Sciweavers

151 search results - page 5 / 31
» Hyperbolic Graphs of Small Complexity
Sort
View
PODC
2006
ACM
15 years 5 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 2 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ç,...
RECOMB
2007
Springer
15 years 12 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
PDCAT
2005
Springer
15 years 5 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
WWW
2004
ACM
16 years 9 days ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair