Sub-n^k Deterministic algorithm for minimum k-way cut in simple graphs

From MaRDI portal

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs

Jump to:navigation, search

MaRDI QIDQ7208342arXivFDO

Authors Mohit Daga

Publication date 2025

Published in arXiv

arXiv classification

This page was built for publication: Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7208342)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Sub-$n%5Ek$_Deterministic_algorithm_for_minimum_$k$-way_cut_in_simple_graphs&oldid=107584091"