Results 1  10
of
508
Efficient Preflow Push Algorithms
 Computers & Oper. Res
"... Algorithms for the maximum flow problem can be grouped into two categories: augmenting path algorithms [9], and preflow push algorithms [11]. Preflow push algorithms are characterized by a drawback known as ping pong effect. In this paper we present a technique that allows to avoid such an effect an ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Algorithms for the maximum flow problem can be grouped into two categories: augmenting path algorithms [9], and preflow push algorithms [11]. Preflow push algorithms are characterized by a drawback known as ping pong effect. In this paper we present a technique that allows to avoid such an effect
ADVANCED ALGORITHMS Preflow Push Algorithm
, 2008
"... All Network Flow algorithms always follow the Augmenting Path techniques to maintain a feasible flow at each stage. The value of the flow is steadily increased until a saturated cut has been formed. This is the signal that the flow has a maximum value. An alternate approach is used by the preflowpu ..."
Abstract
 Add to MetaCart
All Network Flow algorithms always follow the Augmenting Path techniques to maintain a feasible flow at each stage. The value of the flow is steadily increased until a saturated cut has been formed. This is the signal that the flow has a maximum value. An alternate approach is used by the preflowpush
Finegrained Parallel Implementation of the PreflowPush Algorithm in CHR
, 2006
"... Constraint Handling Rules (CHR) is a concurrent, committedchoice, rulebased language. Recently it was shown that programs for standard (operational) semantics can be interpreted in a parallel computation model. As case study, the classical, imperative, parallel, and nonconfluent preflowpush alg ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Constraint Handling Rules (CHR) is a concurrent, committedchoice, rulebased language. Recently it was shown that programs for standard (operational) semantics can be interpreted in a parallel computation model. As case study, the classical, imperative, parallel, and nonconfluent preflowpush
Finegrained Parallel Implementation of the PreflowPush Algorithm in CHR
"... Abstract. Constraint Handling Rules (CHR) is a concurrent, committedchoice, rulebased language. Recently it was shown that programs for standard (operational) semantics can be interpreted in a parallel computation model. As case study, the classical, imperative, parallel, and nonconfluent preflow ..."
Abstract
 Add to MetaCart
confluent preflowpush algorithm is implemented in CHR for refined and for standard semantics. 1 Introduction Constraint Handling Rules (CHR) [5] is a concurrent, committedchoice, rulebased language whichwas originally developed for rapid prototyping and for writing constraint solvers. The operational semantics
An analysis of the highestlevel selection rule in the preflowpush maxflow algorithm
 INFORMATION PROCESSING LETTERS
, 1999
"... Consider the problem of finding a maximum flow in a network. Goldberg and Tarjan introduced the preflowpush method for solving this problem. When this method is implemented with the highestlevel selection rule, then both the running time and the number of pushes are known to be O(n² p m), where n ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
is the number of nodes and m is the number of edges. We give a new proof based on a potential function argument. Potential function arguments may be preferable for analysing preflowpush algorithms, since they are simple and generic.
References
"... Advanced topics in algorithms: bibliography list 2 Finger search trees are described in [3, 6]. The algorithm for shortest path inside a polygon is from [2]. The approximation of optimal seach trees is described in this book [4]. Splay tree were introduced in [5]. The preflow push algorithm appeared ..."
Abstract
 Add to MetaCart
Advanced topics in algorithms: bibliography list 2 Finger search trees are described in [3, 6]. The algorithm for shortest path inside a polygon is from [2]. The approximation of optimal seach trees is described in this book [4]. Splay tree were introduced in [5]. The preflow push algorithm
An Auction Algorithm for the MaxFlow Problem
, 1995
"... We propose a new algorithm for the maxflow problem. It consists of a sequence of augmentations along paths constructed by an auctionlike algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much les ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
less computation than the shortest augmenting paths used by competing methods. Our algorithm outperforms these latter methods as well as stateoftheart preflowpush algorithms by a very large margin in tests with standard randomly generated problems.
124 Identifying Websites with Flow Simulation
"... Abstract. We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the context of Web archiving and website importance computation. To identify the boundaries of a website, we combine th ..."
Abstract
 Add to MetaCart
the use of an online version of the preflowpush algorithm, an algorithm for the maximum flow problem in traffic networks, and of the Markov CLuster (MCL) algorithm. The latter is used on a crawled portion of the Web graph in order to build a seed of initial webpages, a seed which is extended using
Identifying websites with flow simulation
 in &quot;International Conference on Web Engineering
, 2005
"... Abstract. We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the context of Web archiving and website importance computation. To identify the boundaries of a website, we combine th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
the use of an online version of the preflowpush algorithm, an algorithm for the maximum flow problem in traffic networks, and of the Markov CLuster (MCL) algorithm. The latter is used on a crawled portion of the Web graph in order to build a seed of initial webpages, a seed which is extended using
Website Identification DEA Internship Report
, 2003
"... I present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful to identify the boundaries of what to crawl, in the context of Web archiving. For this purpose, I combine the use of an online versio ..."
Abstract
 Add to MetaCart
version of the preflowpush algorithm, an algorithm for the maximum flow problem in traffic networks, and of the Markov CLuster (MCL) algorithm. The latter is used on a crawled portion of the Web graph in order to build a seed of initial webpages, a seed which is extended by the former. Experiments
Results 1  10
of
508