Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic,
131,19 €
The matching problem is one of the central problems in graph theory as well as in the theory of algorithms and their applications. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven.
Jetzt bei Ebay:
![Produktbild - Combinatorial Algebraic Topology [Algorithms and Computation in Mathematics, 21]](https://i.ebayimg.com/thumbs/images/g/Il4AAOSw669f~mdK/s-l140.jpg)
