1629 search results - page 166 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
MOBIHOC
2002
ACM
15 years 10 months ago
2002
ACM
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
APPROX
2010
Springer
15 years 2 days ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
RECOMB
2008
Springer
15 years 11 months ago
2008
Springer
Comparative analysis of protein networks has proven to be a powerful approach for elucidating network structure and predicting protein function and interaction. A fundamental chall...
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...