A parallel approximation algorithm for the max cut problem on cubic graphs

DOI10.1007/3-540-46674-6_4MaRDI QIDQ4501571zbMATH OpenFDO

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

Publication date 7 March 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46674-6_4

zbMATH Keywords

maximum cut problem on cubic graphsNP-completenessparallel algorithmPRAM model

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
• Efficient maximal cubic graph cuts
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Cited in

(5)

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

This page was built for publication: A parallel approximation algorithm for the max cut problem on cubic graphs

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