scientific article; zbMATH DE number 1496855
From MaRDI portal
Publication:4500843
Recommendations
Cited in
(53)- On the complexity of finding balanced oneway cuts
- Easy and difficult objective functions for max cut
- Maximum cutwidth problem for graphs.
- The maximum cardinality cut problem in co-bipartite chain graphs
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- On graphs of the cone decompositions for the min-cut and max-cut problems
- Vertex deletion problems on chordal graphs
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- Well-partitioned chordal graphs
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- On the maximum weight minimal separator
- An exact algorithm for MAX-CUT in sparse graphs
- Computing the largest bond and the maximum connected cut of a graph
- Computing role assignments of split graphs
- Max-Cut and containment relations in graphs
- The maximum cut problem
- scientific article; zbMATH DE number 5999585 (Why is no real title available?)
- scientific article; zbMATH DE number 4145687 (Why is no real title available?)
- Finding Folkman Numbers via MAX CUT Problem
- Rank of Handelman hierarchy for Max-Cut
- Graphs of separability at most 2
- \textsc{max-cut} and containment relations in graphs
- The complexity of finding uniform sparsest cuts in various graph classes
- NP-hardness of the Euclidean Max-Cut problem
- Complexity and polynomially solvable special cases of QUBO
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- Quantum annealing versus digital computing. An experimental comparison
- The complexity of SIMPLE MAX-CUT on comparability graphs
- Complexity of the weighted max-cut in Euclidean space
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- On complexity of the translational-cut algorithm for convex minimax problems
- Intersection graphs of non-crossing paths
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- scientific article; zbMATH DE number 7724211 (Why is no real title available?)
- Complexity of maximum cut on interval graphs
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Graphs with at most two moplexes
- On the proper interval completion problem within some chordal subclasses
- Canonical cuts of path powers
- Complexity of maximum cut on interval graphs
- Word-representable co-bipartite graphs: representation number, speed, and entropy
- Approximating maximum cut on interval graphs and split graphs beyond Goemans-Williamson
- Triangles improve 0.878 approximation for Maxcut
- Bridging treewidth and clique-width via cograph-modular-treewidth
- The parameter report: an orientation guide for data-driven parameterization
- Minimum stable cut and treewidth
- On algorithms for (P₅, gem)-free graphs
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Solving some NP-complete problems using split decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500843)
