Amanote Research

Amanote Research

    RegisterSign In

Maximum Flow in Planar Networks

SIAM Journal on Computing - United States
doi 10.1137/0208012
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science
Date

May 1, 1979

Authors
Alon ItaiYossi Shiloach
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Maximum Entropy Analysis of Flow Networks: Theoretical Foundation and Applications

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2019English

Recent Developments in Maximum Flow Algorithms

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2000English

How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

2006English

Iterative Maximum Likelihood on Networks

Advances in Applied Mathematics
Applied Mathematics
2010English

The Distribution of the Maximum Vertex Degree in Random Planar Maps

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Flow Generation by Rotating Colloids in Planar Microchannels

Europhysics Letters
AstronomyPhysics
2010English

Planar Random Networks With Flexible Fibers

Physical Review Letters
AstronomyPhysics
1994English

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

Olympiads in Informatics
2018English

Planar Granular Shear Flow Under External Vibration

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy