Between min cut and graph bisection
From MaRDI portal
Recommendations
- On minimum bisection and related cut problems in trees and tree-like graphs
- The MIN-cut and vertex separator problem
- An exact combinatorial algorithm for minimum graph bisection
- Cutsets in bipartite graphs*
- On the Number of Minimum Cuts in a Graph
- scientific article; zbMATH DE number 2089977
- Graph bisection revisited
- On the graph bisection problem
- Minimum cuts in geometric intersection graphs
- scientific article; zbMATH DE number 3891429
Cited in
(32)- -vertex separator is NP-hard even for 3-regular graphs
- SONET/SDH ring assignment with capacity constraints
- Multiway \(p\)-spectral graph cuts on Grassmann manifolds
- A review on spectral clustering and stochastic block models
- Decision-based scenario clustering for decision-making under uncertainty
- Partial differential equations and variational methods for geometric processing of images
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering
- A survey of kernel and spectral methods for clustering
- Comparisons of different methods for balanced data classification under the discrete non-local total variational framework
- Diffuse interface models on graphs for classification of high dimensional data
- Clustered matrix approximation
- Vertex Bisection is Hard, too
- Approximating spectral clustering via sampling: a review
- scientific article; zbMATH DE number 3876616 (Why is no real title available?)
- scientific article; zbMATH DE number 3891429 (Why is no real title available?)
- Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut
- On the Graph Bisection Cut Polytope
- On the graph bisection problem
- Hearing the clusters of a graph: A distributed algorithm
- Graph bisection with Pareto optimization
- Effective Resistance Preserving Directed Graph Symmetrization
- scientific article; zbMATH DE number 7255049 (Why is no real title available?)
- A performance guarantee for spectral clustering
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Memetic graph clustering
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Almost exact recovery in noisy semi-supervised learning
- Distributional limits of graph cuts on discretized grids
- A self-adjusting spectral clustering algorithm
This page was built for publication: Between min cut and graph bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260388)
