Parametric analysis on cut-trees and its application on a protein clustering problem

DOI10.1007/S10100-018-0579-YMaRDI QIDQ2303335zbMATH OpenOpenAlexWikidataFDO

Authors João Paulo de Freitas Araujo, Madiagne Diallo, Fernanda Maria Pereira Raupp, Pascal Berthomé, José Eugenio Leal

Publication date 3 March 2020

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10100-018-0579-y

zbMATH Keywords

clusteringcut-treemulti-terminal network flowsparametric analysisprotein complexes

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Sensitivity analysis of 0-1 multiterminal network flows
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Generalized parametric multi-terminal flows problem.
• Sensitive and parametric analysis of the maximum flow in a network
• Parametric min-cuts analysis in a network.

Cites work

• A note on the parametric maximum flow problem and some related reoptimization issues
• An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
• Cut tree algorithms: An experimental study
• scientific article; zbMATH DE number 1805583 (Why is no real title available?)
• Multi-Terminal Network Flows
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• Sensitivity Analysis of Multiterminal Flow Networks
• Synthesis of multiterminal communication nets: Finding one or all solutions
• Very Simple Methods for All Pairs Network Flow Analysis

This page was built for publication: Parametric analysis on cut-trees and its application on a protein clustering problem

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