Amanote Research
Register
Sign In
Computing Maximum Flow With Augmenting Electrical Flows
doi 10.1109/focs.2016.70
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 2016
Authors
Aleksander Madry
Publisher
IEEE
Related search
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
Computing Square Roots of Graphs With Low Maximum Degree
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Flow Augmenting Routing With Network Coding for Lifetime Maximization in Wireless Networks
Maximum Entropy Flows for Single-Source Networks
Engineering Optimization
Control
Industrial
Optimization
Applied Mathematics
Manufacturing Engineering
Management Science
Computer Science Applications
Operations Research
Electrical Impedance-Based Void Fraction Measurement and Flow Regime Identification in Microchannel Flows Under Adiabatic Conditions
International Journal of Multiphase Flow
Transfer Processes
Fluid Flow
Astronomy
Physics
Mechanical Engineering
The Algorithm of Finding of K Maximum Flows
SPIIRAS Proceedings
Control
Systems Engineering
Information Systems
Computer Networks
Applied Mathematics
Mathematics
Communications
Computer Science Applications
Computational Theory
Computational Mathematics
Artificial Intelligence
Maximum Flows and Minimum Cuts in the Plane
Journal of Global Optimization
Control
Optimization
Applied Mathematics
Management Science
Computer Science Applications
Operations Research
Maximum Flow in Planar Networks
SIAM Journal on Computing
Mathematics
Computer Science
Tidal Flow: A Fast and Teachable Maximum Flow Algorithm
Olympiads in Informatics
