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

Download
  1. (PDF, 276 KB)
DOIResolve DOI: http://doi.org/10.4224/8914267
AuthorSearch for:
TypeTechnical Report
Subjectvital edge; maximal flow; algorithm design
AbstractA 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
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number48305
NPARC number8914267
Export citationExport as RIS
Report a correctionReport a correction
Record identifier033a53c8-1641-405b-af69-ce51ac53cab4
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)