The following pages link to (Q3983251):
Displaying 18 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- The sparse sequences of graphs (Q6640961) (← links)
