scientific article; zbMATH DE number 2079379

zbMath1092.68623MaRDI QIDQ4471338

Naveen Garg, Friedrich Eisenbrand, Stefan Funke, Jochen Könemann

Publication date: 28 July 2004

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Complementation in T-perfect graphs ⋮ $t$-Perfection in $P_5$-Free Graphs ⋮ An SDP primal-dual algorithm for approximating the Lovász-theta function ⋮ On the rational polytopes with Chvátal rank 1 ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Distributed Approximate Maximum Matching in the CONGEST Model.

This page was built for publication: