"(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the ..."

Michael Elkin, Seth Pettie, Hsin-Hao Su (2015)

> Home

Details and statistics

DOI: 10.1137/1.9781611973730.26

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/soda/ElkinPS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ElkinPS15
Michael Elkin, Seth Pettie, Hsin-Hao Su:
(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. SODA 2015: 355-370

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.