scientific article; zbMATH DE number 3399279
From MaRDI portal
Publication:5666587
Cited in
(7)- Integer programs for logic constraint satisfaction
- Linear programs for constraint satisfaction problems
- Distributed approximate maximum matching in the CONGEST model
- Solving simultaneous target assignment and path planning efficiently with time-independent execution
- Distributed maximum matching verification in CONGEST
- Approximating bipartite minimum vertex cover in the Congest model
- A query-efficient quantum algorithm for maximum matching on general graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666587)