Matches in SemOpenAlex for { <https://semopenalex.org/work/W2016333048> ?p ?o ?g. }
Showing items 1 to 48 of
48
with 100 items per page.
- W2016333048 endingPage "72" @default.
- W2016333048 startingPage "61" @default.
- W2016333048 abstract "Abstract A problem of interest in flow networks is that of finding the smallest disconnecting set. Let s, s′, and t be three distinct arbitrary vertices in a directed graph and let τ s,t be the value of the smallest s-t-cut. A method is given for significantly reducing the number of steps needed to calculate τ s,t once τ s′,t has been found by the Ford—Fulkerson labelling algorithm. This new method, called the Flow Variation Algorithm , has been successfully used in finding the smallest disconnecting sets in graphs with up to ninety vertices and eight hundred branches." @default.
- W2016333048 created "2016-06-24" @default.
- W2016333048 creator A5012814420 @default.
- W2016333048 date "1969-01-01" @default.
- W2016333048 modified "2023-09-30" @default.
- W2016333048 title "Flow variation in multiple min-cut calculations" @default.
- W2016333048 cites W2024892575 @default.
- W2016333048 cites W2115049345 @default.
- W2016333048 doi "https://doi.org/10.1016/0016-0032(69)90032-5" @default.
- W2016333048 hasPublicationYear "1969" @default.
- W2016333048 type Work @default.
- W2016333048 sameAs 2016333048 @default.
- W2016333048 citedByCount "9" @default.
- W2016333048 crossrefType "journal-article" @default.
- W2016333048 hasAuthorship W2016333048A5012814420 @default.
- W2016333048 hasConcept C121332964 @default.
- W2016333048 hasConcept C2778334786 @default.
- W2016333048 hasConcept C33923547 @default.
- W2016333048 hasConcept C38349280 @default.
- W2016333048 hasConcept C44870925 @default.
- W2016333048 hasConcept C57879066 @default.
- W2016333048 hasConceptScore W2016333048C121332964 @default.
- W2016333048 hasConceptScore W2016333048C2778334786 @default.
- W2016333048 hasConceptScore W2016333048C33923547 @default.
- W2016333048 hasConceptScore W2016333048C38349280 @default.
- W2016333048 hasConceptScore W2016333048C44870925 @default.
- W2016333048 hasConceptScore W2016333048C57879066 @default.
- W2016333048 hasIssue "1" @default.
- W2016333048 hasLocation W20163330481 @default.
- W2016333048 hasOpenAccess W2016333048 @default.
- W2016333048 hasPrimaryLocation W20163330481 @default.
- W2016333048 hasRelatedWork W2001154055 @default.
- W2016333048 hasRelatedWork W2034547891 @default.
- W2016333048 hasRelatedWork W2047918806 @default.
- W2016333048 hasRelatedWork W2174122965 @default.
- W2016333048 hasRelatedWork W2298446516 @default.
- W2016333048 hasRelatedWork W2322870664 @default.
- W2016333048 hasRelatedWork W2384147175 @default.
- W2016333048 hasRelatedWork W2462047661 @default.
- W2016333048 hasRelatedWork W3119366829 @default.
- W2016333048 hasRelatedWork W4223440842 @default.
- W2016333048 hasVolume "287" @default.
- W2016333048 isParatext "false" @default.
- W2016333048 isRetracted "false" @default.
- W2016333048 magId "2016333048" @default.
- W2016333048 workType "article" @default.