scientific article
From MaRDI portal
Publication:3983251
zbMath0753.05029MaRDI QIDQ3983251
J. Mark Keil, Timothy B. Brecht
Publication date: 27 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width ⋮ Approximation of the Quadratic Knapsack Problem ⋮ Finding connected \(k\)-subgraphs with high density ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ Tight complexity bounds for FPT subgraph problems parameterized by the clique-width ⋮ The densest \(k\)-subgraph problem on clique graphs ⋮ FPT approximation and subexponential algorithms for covering few or many edges ⋮ Exact algorithms for problems related to the densest \(k\)-set problem ⋮ Quantum solutions for densest \(k\)-subgraph problems ⋮ A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs ⋮ Parameterized algorithms for the happy set problem ⋮ Network flow interdiction on planar graphs ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs ⋮ On solving the densestk-subgraph problem on large graphs
