A simple polynomial time algorithm for max cut on laminar geometric intersection graphs

DOI10.4230/LIPICS.FSTTCS.2022.21MaRDI QIDQ6604632zbMATH OpenFDO

Authors Utkarsh Joshi, Saladi Rahul, Josson Joe Thoppil

Publication date 12 September 2024

zbMATH Keywords

geometric intersection graphsmax cutvertical ray shooting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

This page was built for publication: A simple polynomial time algorithm for max cut on laminar geometric intersection graphs

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