Pages that link to "Item:Q2334039"
From MaRDI portal
The following pages link to Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039):
Displaying 4 items.
- A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)