Indexed metadata

Combinatorial Properties and the Complexity of a Max-cut Approximation

Charles Delorme, Svatopluk Poljak

Source record

Source: Crossref

Published: Jul 1, 1993

DOI: 10.1006/eujc.1993.1035

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Combinatorial Properties and the Complexity of a Max-cut Approximation — Mathematical Frontier Network