Language selection

Government of Canada / Gouvernement du Canada

Search

Addressing the Problem of Finding a Single Vital Edge in a Maximum Flow Graph

From National Research Council Canada

Download
  1. (PDF, 571 KiB)
DOIResolve DOI: https://doi.org/10.4224/8914267
AuthorSearch for:
FormatText, Technical Report
Subjectvital edge; maximal flow; algorithm design; flux maximal; conception d'algorithmes
Abstract
A first attempt is made to understand some of the theoretical considerations in the design of a solution to the problem of finding a vital edge in a flow graph G. Examples are used to conjecture the existence of four equivalence classes for the set of all possible flow graphs; both of which (counter examples and partitions) are presented in sufficient detail as to allow the possibility of potentially deriving a specific algorithm and hence implementation.
Publication date
LanguageEnglish
NRC numberNRCC 48305
NPARC number8914267
Export citationExport as RIS
Report a correctionReport a correction (opens in a new tab)
Record identifier033a53c8-1641-405b-af69-ce51ac53cab4
Record created2009-04-22
Record modified2020-05-27
Date modified: