Generating pseudo-random permutations and maximum flow algorithms

DOI10.1016/0020-0190(90)90024-RzbMath0702.68087MaRDI QIDQ915489

Noga Alon

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

design of algorithmsderandomizationpseudo-random permutationslongest common ascending subsequencerandomized maximum-flow algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (9)

On Compatible Matchings ⋮ Recent developments in maximum flow algorithms ⋮ Constructions of permutation arrays for certain scheduling cost measures ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Search for all \(d\)-mincuts of a limited-flow network ⋮ Computational investigations of maximum flow algorithms ⋮ Quasirandom permutations ⋮ Quasirandom arithmetic permutations ⋮ Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity

Cites Work

• Scaling algorithms for network problems
• A data structure for dynamic trees
• A Fast and Simple Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• Improved Time Bounds for the Maximum Flow Problem

This page was built for publication: Generating pseudo-random permutations and maximum flow algorithms