scientific article; zbMATH DE number 1107723

zbMath0889.05069MaRDI QIDQ4373671

Paola Campadelli, Roberto Posenato, Alberto Bertoni

Publication date: 11 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

upper boundexpectationsmaximum cutrandom matrixNP-hardrandom graphMAXIMUM CUT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

On the maximal cut in a random hypergraph ⋮ Preface ⋮ Sparse graphs: Metrics and random models ⋮ MAX k‐CUT and approximating the chromatic number of random graphs ⋮ The Ising Antiferromagnet and Max Cut on Random Regular Graphs

This page was built for publication: