ResearchTrend.AI
  • Papers
  • Communities
  • Organizations
  • Events
  • Blog
  • Pricing
  • Feedback
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2303.05408
  4. Cited By
Fast algorithms for Vizing's theorem on bounded degree graphs
v1v2v3v4 (latest)

Fast algorithms for Vizing's theorem on bounded degree graphs

9 March 2023
Anton Bernshteyn
A. Dhawan
ArXiv (abs)PDFHTML

Papers citing "Fast algorithms for Vizing's theorem on bounded degree graphs"

3 / 3 papers shown
Title
Borel versions of the Local Lemma and LOCAL algorithms for graphs of
  finite asymptotic separation index
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
Anton Bernshteyn
F. Weilacher
61
7
0
28 Aug 2023
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Edge-Coloring Algorithms for Bounded Degree Multigraphs
A. Dhawan
66
4
0
13 Jul 2023
Borel Vizing's Theorem for Graphs of Subexponential Growth
Borel Vizing's Theorem for Graphs of Subexponential Growth
Anton Bernshteyn
A. Dhawan
147
7
0
30 Jun 2023
1