An O(n0.1537)O(n^{0.1537})O(n0.1537)-Coloring Algorithm for 3-Colorable Graphswith Ken-ichi Kawarabayashi, Hirotaka Yoneda, Masataka Yoneda1 versionW_xpxgw7a8v1 · current
EPTAS for Hard Graph Cut Problems for Dense GraphsKaisei Deguchi, Ken-ichi Kawarabayashi, Hiroaki Mori0 citations2605.07265v12026arXiv