Maximum flows and minimum cuts in the plane

DOI10.1007/978-0-387-75714-8_1zbMATH Open1192.49050OpenAlexW4229572237MaRDI QIDQ3565455FDOQ3565455

Authors: Gilbert Strang 

Publication date: 4 June 2010

Published in: Advances in Mechanics and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-75714-8_1

Recommendations

• Maximum flows and minimum cuts in the plane
• On maximum flows in polyhedral domains
• A measure-theoretical max-flow-min-cut problem
• Max-flow min-cut theorem in an anisotropic network
• Combinatorial continuous maximum flow

zbMATH Keywords

maximum flowminimum cutcapacity constraintCheeger

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Variational principles of physics (49S05) Duality theory (optimization) (49N15)

Cites Work

• Maximal Flow Through a Network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eigenvalues and expanders
• Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dual spaces of stresses and strains, with applications to Hencky plasticity
• Geometric bounds for eigenvalues of Markov chains
• Laplacians and the Cheeger inequality for directed graphs
• Title not available (Why is that?)
• The Isoperimetric Problem in the Minkowski Plane
• An integral formula for total gradient variation
• Title not available (Why is that?)
• Maximal flow through a domain
• Title not available (Why is that?)
• Maximum area with Minkowski measures of perimeter
• Title not available (Why is that?)
• Max-flow min-cut theorem in an anisotropic network
• The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
• Analysis of an inverse problem arising in photolithography
• Discrete Approximations to Continuum Optimal Flow Problems
• Title not available (Why is that?)

Cited In (12)

• Combinatorial continuous maximum flow
• Maximum flows and minimum cuts in the plane
• Title not available (Why is that?)
• On maximum flows in polyhedral domains
• Title not available (Why is that?)
• Numerical methods for the vector-valued solutions of non-smooth eigenvalue problems
• Maximum cuts for a minimum flow
• Optimal geometric flows via dual programs
• A projection approach to the numerical analysis of limit load problems
• Discrete Approximations to Continuum Optimal Flow Problems
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds

This page was built for publication: Maximum flows and minimum cuts in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565455)