Object structure

Title:

A New Efficient Method of Enumerating all Min-d-Cut-Sets in a Flow Network

Subtitle:

Raport Badawczy = Research Report ; RB/8/2017

Creator:

Malinowski, Jacek Antoni. Autor

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2017

Description:

32 pages ; 21 cm ; Bibliography p. 31-32

Subject and Keywords:

Flow network ; Flow capacity of a component/network ; Required flow ; Maximum flow ; Min-cut-set ; Min-d-cut-set ; Enumeration of cut-sets ; Sieć przepływowa ; Przepływność komponentu/sieci ; Wymagany przepływ ; Maksymalny przepływ ; Przekrój minimalny ; Minimalny d-przekrój ; Generowanie przekrojów

Abstract:

In this paper two efficient algorithms are proposed for the purpose of enumerating all minimal d-cut-sets in a flow network with one source and one sink node.

Relation:

Raport Badawczy = Research Report

Resource Type:

Report

Source:

RB-2017-08

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

×

Citation

Citation style: