Login / Signup

Fast algorithms for Vizing's theorem on bounded degree graphs.

Anton BernshteynAbhishek Dhawan
Published in: CoRR (2023)
Keyphrases
  • graph theoretic
  • learning algorithm
  • data structure
  • bounded treewidth