(Enter summary)
Abstract: The dynamic version of the maximum flow problem allows the graph underlying the flow network
to change over time. The graph receives corrections to its structure or capacities and consequently the
value of the maximum flow is modified. These corrections arrive in real time. In this paper, parallel
and sequential solutions to the real-time maximum flow problem are developed on the Reconfigurable
Multiple Bus Machine (RMBM) model and on the Random Access Machine (RAM) model, respectively.
The... (Update)
Context of citations to this paper: More
...s(n) t(n) or P 2 F Gamma DRMBM(p(n) s(n) t(n) etc. and that R has size complexity p(n) Theta b(n) it is customary [10, 17] to consider the size of a network as being the product between the number of processors and the number of buses) and time complexity...
.... of superunitary behavior with respect to the quality of the solution computed by parallel machines to real time problems [1, 2, 3, 4, 5, 8, 9, 10]. This paper focuses on real time paradigms that resort to the nearest neighbor method in order to compute the desired result....
Cited by: More
An Algorithmic Model for Real Time Computation - Akl (2002)
(Correct)
Discrete Steepest Descent In Real Time - Akl (2001)
(Correct)
Computing Nearest Neighbors In Real Time - Nagy, Akl (2001)
(Correct)
Active bibliography (related documents): More All
1.5: Locating The Median Of A Tree In Real Time - Nagy, Akl (2001)
(Correct)
0.8: Parallel Real-Time Computation: Sometimes Quantity Means Quality - Akl (2002)
(Correct)
0.7: Superlinear Performance In Real-Time Parallel Computation - Akl (2001)
(Correct)
Similar documents based on text: More All
0.3: Simplifying Flow Networks - Biedl, Brejova, Vinar (2000)
(Correct)
0.2: On the Relation Between Parallel Real-Time Computations and.. - Bruda, Akl (2001)
(Correct)
0.2: Real-Time Minimum Vertex Cover For Two-Terminal Series-Parallel.. - Nagy, Akl (2000)
(Correct)
Related documents from co-citation: More All
3: and parallel real-time computation (context) - Akl, maximization - 2000
3: the necessity of formal models for real-time parallel computations
- Bruda, Akl - 2000
3: Real-time minimum vertex cover for two-terminal series-parallel graphs
- Nagy, Akl - 2000
BibTeX entry: (Update)
N. Nagy, The maximum flow problem: A real-time approach, Master's thesis, Department of Computing and Information Science, Queen's University, Jan. 2001. http://citeseer.ist.psu.edu/nagy01maximum.html More
@misc{ nagy01maximum,
author = "N. Nagy",
title = "The maximum flow problem: A real-time approach",
text = "N. Nagy, The maximum flow problem: A real-time approach, Master's thesis,
Department of Computing and Information Science, Queen's University, Jan.
2001.",
year = "2001",
url = "citeseer.ist.psu.edu/nagy01maximum.html" }
Citations (may not include all citations):
162
A new approach to the maximum-flow-problem (context) - Goldberg, Tarjan - 1988
88
Multiprocessor scheduling with the aid of network flow algor.. (context) - Stone - 1977
71
Maximal flow through a network (context) - Ford, Fulkerson - 1956
68
Theoretical improvements in algorithmic efficiency for netwo.. (context) - Edmonds, Karp - 1970
34
A faster deterministic maximum flow algorithm (context) - King, Rao et al. - 1994
28
Beyond the flow decomposition barrier (context) - Goldberg, Rao - 1997
27
parallel MAX-FLOW algorithm (context) - Shiloach, Vishkin et al. - 1982
24
Scaling algorithms for network problems (context) - Gabow - 1985
18
the data-accumulating paradigm
- Bruda, Akl - 1998
18
Parallel real-time optimization: Beyond speedup
- Akl, Bruda - 1999
15
The characterization of data-accumulating algorithms
- Bruda, Akl - 2000
14
A case study in real-time parallel computation: Correcting a..
- Bruda, Akl - 2001
12
Determining the maximal flow in a network by the method of p.. (context) - Karzanov - 1974
10
the power of segmenting and fusing buses (context) - Trahan, Vaidyanathan et al. - 1996
10
Parallel real-time numerical computation: Beyond speedup III
- Akl, Bruda - 2000
8
A parallel blocking flow algorithm for acyclic networks (context) - Vishkin - 1992
8
Parallel real-time cryptography: Beyond speedup II
- Akl, Bruda - 2000
7
Parallel real-time computation: Sometimes quantity means qua..
- Akl - 2000
7
Superlinear performance in real-time parallel computation
- Akl - 2001
6
the necessity of formal models for real-time parallel comput..
- Bruda, Akl - 2000
6
Real-time minimum vertex cover for two-terminal series-paral..
- Nagy, Akl - 2000
4
Real-time computation: A formal definition and its applicati..
- Bruda, Akl - 2000
4
Improving a solution's quality through parallel processing (context) - Akl, Bruda - 2001
4
Towards a meaningful formal definition of real-time computat..
- Bruda, Akl - 2000
3
Pursuit and evasion on a ring: An infinite hierarchy for par..
- Bruda, Akl - 2000
3
Constant time graph algorithms on the reconfigurable multipl.. (context) - Trahan, Vaidyanathan et al. - 1997
3
A parallel algorithm for finding a blocking flow in an acycl.. (context) - Goldberg, Tarjan - 1989
2
Recent developments in maximum flow algorithms
- Goldberg - 1998
2
maximization and parallel real-time computation (context) - Akl - 2000
1
algorithm for the maximum flow problem (context) - Galil, Naamad et al. - 1980
Documents on the same site (http://www.cs.queensu.ca/Department/TechReports/authorsA.html): More
Towards a Meaningful Formal Definition of Real-Time Computations - Bruda, Akl (1999)
(Correct)
Edge-Disjoint Spanning Trees On The Star Network With.. - Fragopoulou, Akl (1993)
(Correct)
Optimal Communication Algorithms On Star Graphs Using.. - Fragopoulou, Akl (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC