Sciweavers

301 search results - page 6 / 61
» Kronecker Graphs: An Approach to Modeling Networks
Sort
View
COLOGNETWENTE
2007
13 years 10 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
APBC
2004
13 years 10 months ago
Representing Experimental Biological Data in Metabolic Networks
This paper describes a novel approach to representing experimental biological data in metabolic networks. The aim is to allow biologists to visualise and analyse the data in the c...
Tim Dwyer, Hardy Rolletschek, Falk Schreiber
ICML
2007
IEEE
14 years 9 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
14 years 3 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner