Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method

DOI10.1007/978-3-319-26520-9_28MaRDI QIDQ3304782zbMATH OpenOpenAlexFDO

Authors 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

Las Vegas methodmaximum cliqueparallel algorithms

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A parallel branch and bound algorithm for the maximum labelled clique problem
• How good are branching rules in DPLL?
• Monotonic matrices and clique search in graphs

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304782)