A graph multi-separator problem for image segmentation
From MaRDI portal
Cites work
- A polyhedral study of lifted multicuts
- A Separator Theorem for Planar Graphs
- An exact algorithm for solving the vertex separator problem
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Clustering with qualitative information
- Coalition structure generation over graphs
- Comparing clusterings -- an information based distance
- Correlation clustering
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Correlation clustering in general weighted graphs
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Global interactions in random field models: a potential function ensuring connectedness
- scientific article; zbMATH DE number 1444011 (Why is no real title available?)
- Multicuts and perturb \& MAP for probabilistic graph clustering
- Multidimensional scaling of measures of distance between partitions
- Multiway cuts in node weighted graphs
- NP-completeness of the Planar Separator Problems
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Reducibility among combinatorial problems
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- The ellipsoid method and its consequences in combinatorial optimization
- The multi-terminal vertex separator problem: branch-and-cut-and-price
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- The partition problem
- The vertex \(k\)-cut problem
- The vertex separator problem: a polyhedral investigation
- The vertex separator problem: algorithms and computations
- Zur allgemeinen Kurventheorie.
This page was built for publication: A graph multi-separator problem for image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009573)
