Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007113317> ?p ?o ?g. }
Showing items 1 to 84 of
84
with 100 items per page.
- W2007113317 endingPage "512" @default.
- W2007113317 startingPage "504" @default.
- W2007113317 abstract "This paper shows that graph traversal techniques have fundamental differences between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. It has three major parts. Section I describes the computational environment for the design and description of distributed graph algorithms in terms of an architectural model for message exchanges. The computational complexity is measured in terms of the number of messages transmitted. Section II presents several distributed algorithms for the pure traversal, depth-first search, and breadth-first search techniques. Their complexities are also given. Through these descriptions are brought out some of the intrinsic differences in the behaviors and complexities of the fundamental traversal techniques between a serial and a distributed computation environment. Section III gives the distributed version of the Ford and Fulkerson algorithm for the maximum flow problem by means of depth-first search, the largest-augmentation search and breadth-first search. The complexities of these methods are found to be 0(f*|A|), 0((l + logM/(M-1)f*|V||A|) and O(|V|6), respectively, where f* is the maximum flow value of the problem, M is the maximum number of ucs in a cut, |V| is the number of vertices, and |A| is the number of arcs. Lastly, it is shown that the largest augmentation search may be a better method than the other two. This is contrary to the known results in serial computation." @default.
- W2007113317 created "2016-06-24" @default.
- W2007113317 creator A5044476800 @default.
- W2007113317 date "1983-07-01" @default.
- W2007113317 modified "2023-10-16" @default.
- W2007113317 title "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation" @default.
- W2007113317 cites W1532690141 @default.
- W2007113317 cites W2013892304 @default.
- W2007113317 cites W2020447185 @default.
- W2007113317 cites W2024760761 @default.
- W2007113317 cites W2078206222 @default.
- W2007113317 cites W2149342630 @default.
- W2007113317 doi "https://doi.org/10.1109/tse.1983.234958" @default.
- W2007113317 hasPublicationYear "1983" @default.
- W2007113317 type Work @default.
- W2007113317 sameAs 2007113317 @default.
- W2007113317 citedByCount "90" @default.
- W2007113317 countsByYear W20071133172012 @default.
- W2007113317 countsByYear W20071133172013 @default.
- W2007113317 countsByYear W20071133172014 @default.
- W2007113317 countsByYear W20071133172015 @default.
- W2007113317 countsByYear W20071133172016 @default.
- W2007113317 countsByYear W20071133172017 @default.
- W2007113317 countsByYear W20071133172018 @default.
- W2007113317 countsByYear W20071133172019 @default.
- W2007113317 countsByYear W20071133172020 @default.
- W2007113317 countsByYear W20071133172021 @default.
- W2007113317 countsByYear W20071133172022 @default.
- W2007113317 countsByYear W20071133172023 @default.
- W2007113317 crossrefType "journal-article" @default.
- W2007113317 hasAuthorship W2007113317A5044476800 @default.
- W2007113317 hasConcept C120314980 @default.
- W2007113317 hasConcept C126255220 @default.
- W2007113317 hasConcept C132525143 @default.
- W2007113317 hasConcept C140745168 @default.
- W2007113317 hasConcept C157469704 @default.
- W2007113317 hasConcept C173608175 @default.
- W2007113317 hasConcept C199360897 @default.
- W2007113317 hasConcept C27458966 @default.
- W2007113317 hasConcept C33923547 @default.
- W2007113317 hasConcept C41008148 @default.
- W2007113317 hasConcept C45374587 @default.
- W2007113317 hasConcept C489000 @default.
- W2007113317 hasConcept C77088390 @default.
- W2007113317 hasConcept C80444323 @default.
- W2007113317 hasConcept C88468194 @default.
- W2007113317 hasConcept C96333769 @default.
- W2007113317 hasConceptScore W2007113317C120314980 @default.
- W2007113317 hasConceptScore W2007113317C126255220 @default.
- W2007113317 hasConceptScore W2007113317C132525143 @default.
- W2007113317 hasConceptScore W2007113317C140745168 @default.
- W2007113317 hasConceptScore W2007113317C157469704 @default.
- W2007113317 hasConceptScore W2007113317C173608175 @default.
- W2007113317 hasConceptScore W2007113317C199360897 @default.
- W2007113317 hasConceptScore W2007113317C27458966 @default.
- W2007113317 hasConceptScore W2007113317C33923547 @default.
- W2007113317 hasConceptScore W2007113317C41008148 @default.
- W2007113317 hasConceptScore W2007113317C45374587 @default.
- W2007113317 hasConceptScore W2007113317C489000 @default.
- W2007113317 hasConceptScore W2007113317C77088390 @default.
- W2007113317 hasConceptScore W2007113317C80444323 @default.
- W2007113317 hasConceptScore W2007113317C88468194 @default.
- W2007113317 hasConceptScore W2007113317C96333769 @default.
- W2007113317 hasIssue "4" @default.
- W2007113317 hasLocation W20071133171 @default.
- W2007113317 hasOpenAccess W2007113317 @default.
- W2007113317 hasPrimaryLocation W20071133171 @default.
- W2007113317 hasRelatedWork W1549236243 @default.
- W2007113317 hasRelatedWork W1572523360 @default.
- W2007113317 hasRelatedWork W1605679998 @default.
- W2007113317 hasRelatedWork W1643278098 @default.
- W2007113317 hasRelatedWork W2007113317 @default.
- W2007113317 hasRelatedWork W2067345703 @default.
- W2007113317 hasRelatedWork W2080682474 @default.
- W2007113317 hasRelatedWork W2134544660 @default.
- W2007113317 hasRelatedWork W4252246366 @default.
- W2007113317 hasRelatedWork W1489697166 @default.
- W2007113317 hasVolume "SE-9" @default.
- W2007113317 isParatext "false" @default.
- W2007113317 isRetracted "false" @default.
- W2007113317 magId "2007113317" @default.
- W2007113317 workType "article" @default.