Mohit Daga

collaborators

2 papers

cs.DS2025

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

Mohit Daga

We present a \emph{deterministic exact algorithm} for the \emph{minimum $k$ -cut problem} on simple graphs. Our approach combines the \emph{principal sequence of partitions (PSP)},…

cs.DS2025

Thin Trees via $k$ -Respecting Cut Identities

Mohit Daga

Thin spanning trees lie at the intersection of graph theory, approximation algorithms, and combinatorial optimization. They are central to the long-standing \emph{thin tree conject…

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

Thin Trees via k-Respecting Cut Identities

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

Thin Trees via $k$ -Respecting Cut Identities