Sciweavers

803 search results - page 127 / 161
» Independence in Direct-Product Graphs
Sort
View
SAC
2006
ACM
14 years 2 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 1 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
COLT
1993
Springer
14 years 17 days ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 10 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
PSB
2004
13 years 9 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini