Pages that link to "Item:Q963469"

The following pages link to A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469):

Displaying 16 items.

• Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
• The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
• On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
• Numerical study of semidefinite bounds for the \(k\)-cluster problem (Q2883586) (← links)
• Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
• Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
• A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)