Pages that link to "Item:Q2426654"
From MaRDI portal
The following pages link to The densest \(k\)-subgraph problem on clique graphs (Q2426654):
Displayed 7 items.
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- The class of \(q\)-cliqued graphs: eigen-bi-balanced characteristic, designs, and an entomological experiment (Q499815) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)