Isolating critical flow path and algorithmic partitioning of the AND/OR mobile workflow graph.
Ihtisham AliSusmit BagchiPublished in: Future Gener. Comput. Syst. (2020)
Keyphrases
- graph partitioning
- partitioning algorithm
- solution path
- mobile devices
- vertex set
- mobile learning
- graph representation
- mobile phone
- graph model
- shortest path
- minimum cut
- weighted graph
- graph theory
- path length
- flow field
- random walk
- min cut
- packet transmission
- hamiltonian path
- spectral graph
- mobile applications
- directed graph
- graph structure
- mobile users
- bipartite graph
- flow patterns
- normalized cut
- connected components
- root node
- spectral clustering
- computing environments
- web services
- image segmentation
- graph cuts
- context aware
- strongly connected
- maximum flow
- directed acyclic graph
- shortest path problem
- optimal path
- edge weights
- graph theoretic
- undirected graph
- mobile technologies