On the cut dimension of a graph

DOI10.4230/lipics.ccc.2021.15arXiv2011.05085OpenAlexW3184566997MaRDI QIDQ6115369

Tongyang Li, Shengyu Zhang, Miklos Santha, Troy Lee

Publication date: 12 July 2023

Full work available at URL: https://arxiv.org/abs/2011.05085

zbMATH Keywords

query complexitysubmodular function minimizationcut dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the cut dimension of a graph