Pages that link to "Item:Q2355318"
From MaRDI portal
The following pages link to A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318):
Displayed 5 items.
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Finding subgraphs with side constraints (Q2117235) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method (Q3304782) (← links)