Finding first, second and third order graphs cuts

MaRDI QIDQ3099047zbMATH OpenFDO

Authors A. A. Grishkevich, Ł. Piątek, A. Burmutaev

Publication date 1 December 2011

zbMATH Keywords

graphminimal cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Minimal Cuts up to Third Order in a Planar Graph
• Minimal graph cuts on network subgraphs
• An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
• A new approach to the minimum cut problem
• An improved algorithm for the planar 3-cut problem

Cited in

(1)

• scientific article; zbMATH DE number 3906531 (Why is no real title available?)

This page was built for publication: Finding first, second and third order graphs cuts

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