4 citations · 6 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Abhishek Dhawan
In this paper, we consider algorithms for edge-coloring multigraphs of bounded maximum degree, i.e., . Shannon's theorem states that any multigraph of maximum degr…
cs.DS2023★ 1 cited
Detection of Dense Subhypergraphs by Low-Degree Polynomials
Abhishek Dhawan, Cheng Mao, Alexander S. Wein
Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergr…
cs.DS2023★ 1 cited
Fast algorithms for Vizing's theorem on bounded degree graphs
Anton Bernshteyn, Abhishek Dhawan
Vizing's theorem states that every graph of maximum degree can be properly edge-colored using colors. The fastest currently known -edge-coloring algorithm for…