The following pages link to \(k\)-edge subgraph problems (Q1356515):
Displaying 17 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- The Parameterized Complexity of k-Edge Induced Subgraphs (Q2843289) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Algorithm Theory - SWAT 2004 (Q5315402) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
