Pages that link to "Item:Q765501"

The following pages link to Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501):

Displaying 2 items.

• PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)