Pages that link to "Item:Q582125"
From MaRDI portal
The following pages link to A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125):
Displaying 4 items.
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)