Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method

DOI10.1007/978-3-319-26520-9_28OpenAlexW2207876967MaRDI QIDQ3304782

Bogdán Zaválnij

Publication date: 3 August 2020

Published in: Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26520-9_28

zbMATH Keywords

parallel algorithmsmaximum cliqueLas Vegas method

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (1)

Decomposing clique search problems into smaller instances based on node and edge colorings

Cites Work

• How good are branching rules in DPLL?
• A parallel branch and bound algorithm for the maximum labelled clique problem
• Unnamed Item

This page was built for publication: Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method