scientific article; zbMATH DE number 1500552

MaRDI QIDQ4501571zbMATH OpenFDO

Authors Irene Finocchi, Rossella Petreschi, Tiziana Calamoneri, Y. Manoussakis

Publication date 7 March 2001

zbMATH Keywords

parallel algorithmNP-completenessPRAM modelmaximum cut problem on cubic graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• On max cut in cubic graphs
• MAX CUT in cubic graphs
• scientific article; zbMATH DE number 176747
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Cited in

(5)

• scientific article; zbMATH DE number 176747 (Why is no real title available?)
• MAX CUT in cubic graphs
• A parallel algorithm for finding minimum cutsets in reducible graphs
• On max cut in cubic graphs
• scientific article; zbMATH DE number 18532 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501571)