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

DOI10.1007/s10100-018-0579-yOpenAlexW2889094912WikidataQ129333523 ScholiaQ129333523MaRDI QIDQ2303335

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

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

clusteringparametric analysiscut-treeprotein complexesmulti-terminal network flows

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• A note on the parametric maximum flow problem and some related reoptimization issues
• Cut Tree Algorithms: An Experimental Study
• Very Simple Methods for All Pairs Network Flow Analysis
• An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
• Multi-Terminal Network Flows
• Synthesis of multiterminal communication nets: Finding one or all solutions
• Sensitivity Analysis of Multiterminal Flow Networks

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