The following pages link to (Q4437509):
Displaying 7 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Graph clustering (Q458448) (← links)
- The computational complexity of densest region detection (Q1604217) (← links)
- Distributed detection of clusters of arbitrary size (Q2117744) (← links)
- The complexity of detecting fixed-density clusters (Q2499577) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- (Q3747722) (← links)
