Skip to main content

and
  1. No Access

    Article

    Sublinear Fully Distributed Partition with Applications

    We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k−1 and having O(n ...

    Bilel Derbel, Mohamed Mosbah, Akka Zemmari in Theory of Computing Systems (2010)