A Fast Distributed Algorithm for $(\Delta + 1)$-Edge-Coloring | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

A Fast Distributed Algorithm for $(\Delta + 1)$-Edge-Coloring

Identifier:nobleid.org/w1/20260515/C362F062

Type:Preprint

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/C362F062.svg?ark=w1%2F20260515%2FC362F062)](https://nobleid.org/work/w1/20260515/C362F062)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Anton Bernshteyn

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy