3204 search results - page 503 / 641 » The b-chromatic Number of a Graph |
171
click to vote
PODC
2005
ACM
16 years 3 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
181
click to vote
PODC
2005
ACM
16 years 3 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
175
click to vote
SAC
2005
ACM
16 years 3 days ago
2005
ACM
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
194
click to vote
WAOA
2005
Springer
16 years 23 hour ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
184
click to vote
STOC
2004
ACM
15 years 12 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...