On the public citation graph
Combinatorial Continuous Maximum Flow
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jvci.2001.0475openalex-snapshot
Geodesic Active Regions: A New Framework to Deal with Frame Partition Problems in Computer Vision
inferredcites →https://doi.org/10.1007/11566489_95openalex-snapshot
Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation
inferredcites →https://doi.org/10.1007/978-0-387-75714-8_1openalex-snapshot
Maximum Flows and Minimum Cuts in the Plane
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/978-1-84996-290-2openalex-snapshot
Discrete Calculus: Applied Analysis on Graphs for Computational Science
inferredcites →https://doi.org/10.1007/978-3-540-88690-7_59openalex-snapshot
A Convex Formulation of Continuous Multi-label Problems
inferredcites →https://doi.org/10.1007/bf01582067openalex-snapshot
Examples of max-flow and min-cut problems with duality gaps in continuous networks
inferredcites →https://doi.org/10.1007/s10851-006-0644-3openalex-snapshot
Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases
inferredcites →https://doi.org/10.1007/s10851-010-0251-1openalex-snapshot
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
inferredcites →https://doi.org/10.1007/s10898-009-9471-6openalex-snapshot
Maximum flows and minimum cuts in the plane
inferredcites →https://doi.org/10.1016/0167-2789(92)90242-fopenalex-snapshot
Nonlinear total variation based noise removal algorithms
inferredcites →https://doi.org/10.1023/b:jmiv.0000011320.81911.38openalex-snapshot
Image Sharpening by Flows Based on Triple Well Potentials
inferredcites →https://doi.org/10.1023/b:jmiv.0000011321.19549.88openalex-snapshot
Affine Invariant Flows in the Beltrami Framework
inferredcites →https://doi.org/10.1086/jar.33.4.3629752openalex-snapshot
An Information Flow Model for Conflict and Fission in Small Groups
inferredcites →https://doi.org/10.1109/34.969114openalex-snapshot
Fast approximate energy minimization via graph cuts
inferredcites →https://doi.org/10.1109/cvpr.2004.1315186openalex-snapshot
Faster graph-theoretic image processing via small-world and quadtree topologies
inferredcites →https://doi.org/10.1109/cvpr.2005.38openalex-snapshot
A Non-Local Algorithm for Image Denoising
inferredcites →https://doi.org/10.1109/iccv.2001.937505openalex-snapshot
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
inferredcites →https://doi.org/10.1109/iccv.2003.1238310openalex-snapshot
Computing geodesics and minimal surfaces via graph cuts
inferredcites →https://doi.org/10.1109/iccv.2009.5459348openalex-snapshot
An algorithm for minimizing the Mumford-Shah functional
inferredcites →https://doi.org/10.1109/tip.2008.924284openalex-snapshot
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
inferredcites →https://doi.org/10.1109/tip.2009.2028258openalex-snapshot
The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph
inferredcites →https://doi.org/10.1109/tpami.2003.1233908openalex-snapshot
Exact optimization for markov random fields with convex priors
inferredcites →https://doi.org/10.1109/tpami.2004.1262177openalex-snapshot
What energy functions can be minimized via graph cuts?
inferredcites →https://doi.org/10.1109/tpami.2006.12openalex-snapshot
Globally minimal surfaces by continuous maximal flows
inferredcites →https://doi.org/10.1109/tpami.2008.82openalex-snapshot
Graph Cuts via $\ell_1$ Norm Minimization
inferredcites →https://doi.org/10.1109/wvm.1989.47097openalex-snapshot
Regularization of discontinuous flow fields
inferredcites →https://doi.org/10.1111/j.1467-9590.2006.00357.xopenalex-snapshot
Discrete Approximations to Continuum Optimal Flow Problems
inferredcites →https://doi.org/10.1137/040608982openalex-snapshot
Second-order Cone Programming Methods for Total Variation-Based Image Restoration
inferredcites →https://doi.org/10.1137/040615286openalex-snapshot
Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
inferredcites →https://doi.org/10.1137/060669358openalex-snapshot
Nonlocal Linear Image Regularization and Supervised Segmentation
inferredcites →https://doi.org/10.1137/080725891openalex-snapshot
The Split Bregman Method for L1-Regularized Problems
inferredcites →https://doi.org/10.1137/090746379openalex-snapshot
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
inferredcites →https://doi.org/10.1145/1198555.1198781openalex-snapshot
Sparse matrix solvers on the GPU
inferredcites →https://doi.org/10.1145/1198555.1198795openalex-snapshot
Linear algebra operators for GPU implementation of numerical algorithms
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/3596711.3596774openalex-snapshot
GrabCut: Interactive Foreground Extraction Using Iterated Graph Cuts
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/882262.882363openalex-snapshot
Linear algebra operators for GPU implementation of numerical algorithms
inferredcites →https://doi.org/10.1145/882262.882364openalex-snapshot
Sparse matrix solvers on the GPU
inferredcites →https://doi.org/10.18910/7180openalex-snapshot
Max-flow min-cut theorem in an anisotropic network
inferredcites →https://doi.org/10.2139/ssrn.4473471openalex-snapshot
Existence and Smoothness of the Navier-Stokes Equation
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.5244/c.22.40openalex-snapshot
TVSeg - Interactive Total Variation Based Image Segmentation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.6792openalex-snapshot
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
inferred← citeshttps://doi.org/10.1002/pamm.202100100openalex-snapshot
Computing the effective crack energy of microstructures via quadratic cone solvers
inferred← citeshttps://doi.org/10.1007/978-1-4419-9779-1_3openalex-snapshot
Seeded Segmentation Methods for Medical Image Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-03009-4_90-1openalex-snapshot
The Potts Model with Different Piecewise Constant Representations and Fast Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-03009-4_90-2openalex-snapshot
The Potts Model with Different Piecewise Constant Representations and Fast Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-03009-4_90-3openalex-snapshot
The Potts Model with Different Piecewise Constant Representations and Fast Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-98661-2_90openalex-snapshot
The Potts Model with Different Piecewise Constant Representations and Fast Algorithms: A Survey
inferred← citeshttps://doi.org/10.1007/s00034-018-0853-1openalex-snapshot
An Effective Weighted Hybrid Regularizing Approach for Image Noise Reduction
inferred← citeshttps://doi.org/10.1007/s00211-013-0569-xopenalex-snapshot
A spatially continuous max-flow and min-cut framework for binary labeling problems
inferred← citeshttps://doi.org/10.1007/s00419-023-02472-7openalex-snapshot
Accounting for weak interfaces in computing the effective crack energy of heterogeneous materials using the composite voxel technique
inferred← citeshttps://doi.org/10.1007/s00466-021-02082-6openalex-snapshot
Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces
inferred← citeshttps://doi.org/10.1007/s00466-022-02241-3openalex-snapshot
Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods
inferred← citeshttps://doi.org/10.1007/s00521-019-04125-9openalex-snapshot
Study on supply chain strategy based on cost income model and multi-access edge computing under the background of the Internet of Things
inferred← citeshttps://doi.org/10.1007/s10107-016-1038-yopenalex-snapshot
Graph cuts with interacting edge weights: examples, approximations, and algorithms
inferred← citeshttps://doi.org/10.1007/s10851-015-0567-yopenalex-snapshot
Global Binary Optimization on Graphs for Classification of High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/s11263-013-0621-4openalex-snapshot
Discrete and Continuous Models for Partitioning Problems
inferred← citeshttps://doi.org/10.1007/s13042-023-01894-7openalex-snapshot
Similarity graph-based max-flow and duality approaches for semi-supervised data classification and image segmentation
inferred← citeshttps://doi.org/10.1007/s13755-022-00176-wopenalex-snapshot
Automatic breast lesion segmentation in phase preserved DCE-MRIs
inferred← citeshttps://doi.org/10.1016/bs.hna.2019.07.002openalex-snapshot
Active contour methods on arbitrary graphs based on partial differential equations
inferred← citeshttps://doi.org/10.1016/j.patrec.2013.11.024openalex-snapshot
Infinity Laplacian on graphs with gradient terms for image and data clustering
inferred← citeshttps://doi.org/10.1093/imanum/drac001openalex-snapshot
Error estimates for finite differences approximations of the total variation
inferred← citeshttps://doi.org/10.1109/jstsp.2012.2213675openalex-snapshot
Active Contours on Graphs: Multiscale Morphology and Graphcuts
inferred← citeshttps://doi.org/10.1109/tpami.2014.2300478openalex-snapshot
Multiclass Data Segmentation Using Diffuse Interface Methods on Graphs
inferred← citeshttps://doi.org/10.1109/tpami.2020.3039745openalex-snapshot
Consistent estimation of the max-flow problem: Towards unsupervised image segmentation
inferred← citeshttps://doi.org/10.1137/120895068openalex-snapshot
Dual Constrained TV-based Regularization on Graphs
inferred← citeshttps://doi.org/10.1137/16m1100101openalex-snapshot
Theoretical Analysis of Active Contours on Graphs
inferred← citeshttps://doi.org/10.1142/s0218001417540222openalex-snapshot
A Novel Weighted Variational Model for Image Denoising
inferred← citeshttps://doi.org/10.1201/b12281-5openalex-snapshot
Targeted Image Segmentation Using Graph Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4539openalex-snapshot
Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
inferred← citeshttps://doi.org/10.5201/ipol.2012.g-tvdopenalex-snapshot
Rudin-Osher-Fatemi Total Variation Denoising using Split Bregman
inferred← citeshttps://doi.org/10.5201/ipol.2013.61openalex-snapshot
Chambolle's Projection Algorithm for Total Variation Denoising
inferred← citeshttps://doi.org/10.5445/ir/1000136993openalex-snapshot
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.