(2Δ − 1)-edge-coloring is much easier than maximal matching in the distributed setting

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Links

  • Michael Elkin , Ben-Gurion University of the Negev, Israel
  • Seth Pettie, Denmark
  • Hsin-Hao Su
Original languageEnglish
Title of host publication Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15
Editors Piotr Indyk
Number of pages16
PublisherSociety for Industrial and Applied Mathematics
Publication year2015
Pages355-370
Publication statusPublished - 2015
EventACM-SIAM Symposium on Discrete Algorithms - San Diego, United States
Duration: 4 Jan 20156 Jan 2015
Conference number: 26

Conference

ConferenceACM-SIAM Symposium on Discrete Algorithms
Nummer26
LandUnited States
BySan Diego
Periode04/01/201506/01/2015

See relations at Aarhus University Citationformats

ID: 85244528