Pages that link to "Item:Q3471882"
From MaRDI portal
The following pages link to Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882):
Displaying 6 items.
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Improved algorithms for largest cardinality 2-interval pattern problem (Q996829) (← links)
- The maximum clique problem (Q1318271) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
