Local improving algorithms for large cuts in graphs with maximum degree three

DOI10.1016/S0012-365X(00)00259-4zbMATH Open0977.05130WikidataQ126388662 ScholiaQ126388662MaRDI QIDQ5937918

Stanisław Bylka

Publication date: 17 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cutNP-completesearch algorithmsswitching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Inventory, storage, reservoirs (90B05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree ⋮ On the Power of Nodes of Degree Four in the Local Max-Cut Problem

This page was built for publication: Local improving algorithms for large cuts in graphs with maximum degree three

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