315 search results - page 6 / 63 » Simple Distributed Weighted Matchings |
INFOCOM
2002
IEEE
14 years 16 days ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
TREC
2008
13 years 9 months ago
2008
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
TON
2010
13 years 6 months ago
2010
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...