Distributional limits of graph cuts on discretized grids
From MaRDI portal
Cites work
- A Cheeger cut for uniform hypergraphs
- A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- Approximation Theorems of Mathematical Statistics
- Asymptotic analysis of stochastic programs
- Balanced partitions of trees and applications
- Clustering based on local density peaks and graph cut
- Consistency of Cheeger and ratio graph cuts
- Consistency of spectral clustering
- Directional differentiability for supremum-type functionals: statistical applications
- Discrete energy on rectifiable sets
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Expander decomposition and pruning: faster, stronger, and simpler
- Finding good approximate vertex and edge partitions is NP-hard
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Graph Clustering and Minimum Cut Trees
- How the result of graph clustering methods depends on the construction of the graph
- scientific article; zbMATH DE number 409722 (Why is no real title available?)
- scientific article; zbMATH DE number 1333614 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- Image Clustering Using Local Discriminant Models and Global Integration
- Isoperimetric numbers of graphs
- Limit laws for empirical optimal solutions in random linear programs
- Multi-Terminal Network Flows
- On concepts of directional differentiability
- On nondifferentiable functions and the bootstrap
- On the Quality of Spectral Separators
- Random sampling in cut, flow, and network design problems
- SOFSEM 2006: Theory and Practice of Computer Science
- Some asymptotic theory for the bootstrap
- Spectral clustering based on local linear approximations
- Spectral clustering in the dynamic stochastic block model
- Subsampling
- The Complexity of Multiterminal Cuts
- The normalized graph cut and Cheeger constant: from discrete to continuous
- Very Simple Methods for All Pairs Network Flow Analysis
This page was built for publication: Distributional limits of graph cuts on discretized grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862790)
