Complexity of maximum cut on interval graphs

From MaRDI portal
Publication:6174803

DOI10.1007/s00454-022-00472-yarXiv2006.00061OpenAlexW3029513181MaRDI QIDQ6174803

Satwik Mukherjee, Kaustav Bose, Ranendu Adhikary, Bodhayan Roy

Publication date: 17 August 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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




Related Items (3)



Cites Work


This page was built for publication: Complexity of maximum cut on interval graphs