Results 1  10
of
1,172,436
Maximum SkewSymmetric Flows
 PROCEEDINGS OF THE 3RD ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 1995
"... We introduce the maximum skewsymmetric flow problem which generalizes flow and matching problems. We develop a theory of skewsymmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We introduce the maximum skewsymmetric flow problem which generalizes flow and matching problems. We develop a theory of skewsymmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skewsymmetric
Maximum skewsymmetric flows and matchings
 MATHEMATICAL PROGRAMMING
, 2004
"... The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical r ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical
Maximum SkewSymmetric Flows and Their Applications to BMatchings
, 1999
"... We introduce the maximum integer skewsymmetric flow problem (MSFP) which generalizes both the maximum flow and maximum matching problems. We establish analogs of the classical flow decomposition, augmenting path, and maxflow mincut theorems for skewsymmetric flows. These theoretical results are t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce the maximum integer skewsymmetric flow problem (MSFP) which generalizes both the maximum flow and maximum matching problems. We establish analogs of the classical flow decomposition, augmenting path, and maxflow mincut theorems for skewsymmetric flows. These theoretical results
Path Problems In SkewSymmetric Graphs
, 1993
"... . We study path problems in skewsymmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skewsymmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
. We study path problems in skewsymmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skewsymmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 676 (34 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 568 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract

Cited by 621 (46 self)
 Add to MetaCart
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case
Performance of optical flow techniques
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1994
"... While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential, ..."
Abstract

Cited by 1324 (32 self)
 Add to MetaCart
While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1972 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Token flow control
"... As companies move towards manycore chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, stateoftheart onchip networks use a modular packetswitched design with route ..."
Abstract

Cited by 627 (35 self)
 Add to MetaCart
with routers at every hop which allow sharing of network channels over multiple packet flows. This, however, leads to packets going through a complex router pipeline at every hop, resulting in the overall communication energy/delay being dominated by the router overhead, as opposed to just wire energy
Results 1  10
of
1,172,436