scientific article; zbMATH DE number 3999696

MaRDI QIDQ4726070zbMATH OpenFDO

Authors I. Arany

Publication date 1986

zbMATH Keywords

minimum cut-setundirected connected non-complete graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1234600
• scientific article; zbMATH DE number 742961
• Finding all minimum-size separating vertex sets in a graph
• An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
• scientific article; zbMATH DE number 4091549

Cited in

(7)

• A constrained minimum cost s-t cutset problem
• Finding all minimum-size separating vertex sets in a graph
• scientific article; zbMATH DE number 3851099 (Why is no real title available?)
• Iterative algorithms for generating minimal cutsets in directed graphs
• scientific article; zbMATH DE number 4091549 (Why is no real title available?)
• An \NC Algorithm for Minimum Cuts
• Algorithms for the determination of cutsets in a hypergraph

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 Q4726070)