Work

MAX CUT in cubic graphs

Year: 2002

Type: conference-paper

Source: Symposium on Discrete Algorithms

DOI: 10.5555/545381.545449

Authors: Eran Halperin, Dror Livnat, Uri Zwick

Institution: Tel Aviv University

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: W2070514342

FWCI: 0.492

Cites: 12

Cited by: 4

Related to: 10