Improved distributed degree splitting and edge coloring

@article{Ghaffari2019ImprovedDD,
  title={Improved distributed degree splitting and edge coloring},
  author={Mohsen Ghaffari and Juho Hirvonen and Fabian Kuhn and Yannic Maus and Jukka Suomela and Jara Uitto},
  journal={Distributed Computing},
  year={2019},
  pages={1-18}
}
  • Mohsen Ghaffari, Juho Hirvonen, +3 authors Jara Uitto
  • Published 2019
  • Engineering, Computer Science
  • Distributed Computing
  • The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic distributed algorithms for both variants, which improve on their counterparts presented by Ghaffari… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES

    Efficient Parallel Algorithms for Edge Coloring Problems

    VIEW 1 EXCERPT

    Distributive graph algorithms Global solutions from local data

    • Nathan Linial
    • Mathematics, Computer Science
    • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
    • 1987
    VIEW 2 EXCERPTS

    Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching

    VIEW 1 EXCERPT

    On Derandomizing Local Distributed Algorithms

    VIEW 1 EXCERPT

    Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

    • David G. Harris
    • Computer Science
    • 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2019