Generalized Parametric Multi-terminal Flows Problem

Given an undirected edge-weighted n-nodes network in which a single edge-capacity is allowed to vary, Elmaghraby studied the sensitivity analysis of the multi-terminal network flows. The procedure he proposed requires the computation of as many Gomory-Hu cut trees as the number of critical capacitie...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Berthomé, Pascal, Diallo, Madiagne, Ferreira, Afonso
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Dynamic Networks Exact sciences and technology Gomory-Hu Cut Tree Information retrieval. Graph Max-Flow Min-Cut Multi-Terminal Flows Network Management Parametric Flows Sensitivity Analysis Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!