Efficient maximal cubic graph cuts

DOI10.1007/3-540-54233-7_147MaRDI QIDQ4036577zbMATH OpenFDO

Authors Martin Loebl

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54233-7_147

zbMATH Keywords

cubic graphmaximal cut problempolynomial algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On max cut in cubic graphs
• MAX CUT in cubic graphs
• A parallel approximation algorithm for the max cut problem on cubic graphs
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
• scientific article; zbMATH DE number 780784

Cited in

(15)

• Max-cut in circulant graphs
• Cuts in undirected graphs. I
• Settling the complexity of local max-cut (almost) completely
• Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
• On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
• scientific article; zbMATH DE number 4145687 (Why is no real title available?)
• Optimization and optimality test for the Max-Cut Problem
• Recouvrement et partition en chaînes des arêtes d'un graphe cubique
• On max cut in cubic graphs
• A parallel approximation algorithm for the max cut problem on cubic graphs
• Integer Linear Programs and Local Search for Max-Cut
• Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
• Minimum stable cut and treewidth
• Minimum stable cut and treewidth

This page was built for publication: Efficient maximal cubic graph cuts

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