scientific article; zbMATH DE number 1496855
From MaRDI portal
Publication:4500843
zbMath0963.68224MaRDI QIDQ4500843
Klaus Jansen, Hans L. Bodlaender
Publication date: 27 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs ⋮ Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) ⋮ Computing role assignments of split graphs ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Well-partitioned chordal graphs ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs ⋮ Quantum Annealing versus Digital Computing ⋮ Graphs of separability at most 2 ⋮ Complexity of maximum cut on interval graphs ⋮ The maximum cardinality cut problem in co-bipartite chain graphs ⋮ \textsc{max-cut} and containment relations in graphs ⋮ An exact algorithm for MAX-CUT in sparse graphs ⋮ Solving some NP-complete problems using split decomposition ⋮ A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs ⋮ A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs ⋮ Intersection graphs of non-crossing paths ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ max-cut and Containment Relations in Graphs ⋮ Vertex deletion problems on chordal graphs ⋮ A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs ⋮ Maximum cuts in edge-colored graphs ⋮ Subexponential algorithms for variants of the homomorphism problem in string graphs ⋮ On the maximum cardinality cut problem in proper interval graphs and related graph classes ⋮ On the maximum weight minimal separator ⋮ On algorithms for (\(P_5\), gem)-free graphs
This page was built for publication:
