3211 search results - page 317 / 643 » On the Grundy Number of a Graph |
188
click to vote
APPROX
2010
Springer
15 years 8 months 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...
156
click to vote
CCR
2004
15 years 6 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
196
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
165
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
172
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...