scientific article; zbMATH DE number 913348

DOI10.1002/(SICI)1097-0037(199603)27:2%3C117::AID-NET3%3E3.0.CO;2-NzbMATH Open0851.90124MaRDI QIDQ4887740FDOQ4887740

Frieda Granot, Maurice Queyranne, Michal Penn

Publication date: 5 August 1996

Title of this publication is not available (Why is that?)

Recommendations

• Multicommodity disconnecting set problem
• Disjoint (s, t)‐cuts in a network
• Extracting maximal information about sets of minimum cuts
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• Mathematical Foundations of Computer Science 2004

zbMATH Keywords

mixed networks\(S\)-disconnecting settwo-pair multicommodity problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (2)

• Minimizing symmetric submodular functions
• Ordered optimal solutions and parametric minimum cut problems

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