Maximum Flows and Minimum Cuts in the Plane
From MaRDI portal
Publication:3565455
DOI10.1007/978-0-387-75714-8_1zbMath1192.49050OpenAlexW4229572237MaRDI QIDQ3565455
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
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Duality theory (optimization) (49N15) Variational principles of physics (49S05)
Related Items
Numerical methods for the vector-valued solutions of non-smooth eigenvalue problems ⋮ Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ A PROJECTION APPROACH TO THE NUMERICAL ANALYSIS OF LIMIT LOAD PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An integral formula for total gradient variation
- Dual spaces of stresses and strains, with applications to Hencky plasticity
- Geometric bounds for eigenvalues of Markov chains
- Eigenvalues and expanders
- 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
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Laplacians and the Cheeger inequality for directed graphs
- Max-flow min-cut theorem in an anisotropic network
- The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem
- ANALYSIS OF AN INVERSE PROBLEM ARISING IN PHOTOLITHOGRAPHY
- Maximal Flow Through a Network
- Discrete Approximations to Continuum Optimal Flow Problems
- Maximal flow through a domain
- Maximum area with Minkowski measures of perimeter
- The Isoperimetric Problem in the Minkowski Plane
