Work

Max-cut Problem

Type: article

Authors: Lecturer Kartik, Sivaramakrishnan Scribe, Sahar Karimi

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W7096657586

Cites:

Cited by:

Related to: 9