1 Search Results for "Mukherjee, Satwik"


Document
Complexity of Maximum Cut on Interval Graphs

Authors: Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, and Bodhayan Roy

Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)


Abstract
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.

Cite as

Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, and Bodhayan Roy. Complexity of Maximum Cut on Interval Graphs. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 7:1-7:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@InProceedings{adhikary_et_al:LIPIcs.SoCG.2021.7,
  author =	{Adhikary, Ranendu and Bose, Kaustav and Mukherjee, Satwik and Roy, Bodhayan},
  title =	{{Complexity of Maximum Cut on Interval Graphs}},
  booktitle =	{37th International Symposium on Computational Geometry (SoCG 2021)},
  pages =	{7:1--7:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-184-9},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{189},
  editor =	{Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.7},
  URN =		{urn:nbn:de:0030-drops-138067},
  doi =		{10.4230/LIPIcs.SoCG.2021.7},
  annote =	{Keywords: Maximum cut, Interval graph, NP-complete}
}
  • Refine by Author
  • 1 Adhikary, Ranendu
  • 1 Bose, Kaustav
  • 1 Mukherjee, Satwik
  • 1 Roy, Bodhayan

  • Refine by Classification
  • 1 Mathematics of computing → Combinatorial optimization
  • 1 Theory of computation → Problems, reductions and completeness

  • Refine by Keyword
  • 1 Interval graph
  • 1 Maximum cut
  • 1 NP-complete

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail