Pages that link to "Item:Q1179213"
From MaRDI portal
The following pages link to Parallel computation of matchings in trees (Q1179213):
Displaying 9 items.
- A matching algorithm in PMWL based on CluTree (Q265007) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees (Q1391915) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- Parallelizing computation of expected values in recombinant binomial trees (Q4960568) (← links)
- Fast parallel reordering and isomorphism testing of \(k\)-trees (Q5956832) (← links)