|
|
Sold Out
Book Categories |
| 1 | Introduction | 1 |
| 2 | Combinatorial tools | 8 |
| 3 | Three sequential algorithms | 22 |
| 4 | Probabilistic tools | 41 |
| 5 | Algebraic tools | 55 |
| 6 | Maximum cardinality matchings | 73 |
| 7 | Inclusion maximal matchings | 94 |
| 8 | Maximal independent sets | 104 |
| 9 | Four easy subclasses of graphs | 116 |
| 10 | Families of intervals | 131 |
| 11 | Parallel algorithms for f-matchings | 139 |
| 12 | Parallelization of sequential algorithms | 151 |
| 13 | Pfaffians, counting the number of matchings, and planar graphs | 164 |
| 14 | Basic applications of parallel matching | 171 |
| 15 | More applications | 187 |
| Bibliography | 198 | |
| Index | 207 |
| Price | Condition | Delivery | Seller | Action |
| $119.00 | Digital |
| WonderClub |
Grant Lewandoski
reviewed Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach on December 05, 2019
Fast Parallel Algorithms for Graph Matching Problems
Skimmed through most of this; it looked good, and there were several wonderful examples I'd never seen before (generally, results I'd seen achieved with trivial topological results, but not through a "pure" graph theory methodology).
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach
X
This Item is in Your Inventory
Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach
X
You must be logged in to review the productsX
X
X
Add Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach, The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for stu, Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach to the inventory that you are selling on WonderClubX
X
Add Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach, The matching problem is central to graph theory and the theory of algorithms. This book provides a comprehensive and straightforward introduction to the basic methods for designing efficient parallel algorithms for graph matching problems. Written for stu, Fast Parallel Algorithms for Graph Matching Problems: Combinatorial, Algebraic, and Probabilistic Approach to your collection on WonderClub |