Pages that link to "Item:Q1268785"
From MaRDI portal
The following pages link to An efficient parallel algorithm for maximum matching for some classes of graphs (Q1268785):
Displaying 8 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- An optimal parallel matching algorithm for cographs (Q1338271) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Parallel algorithms for flexible pattern matching on big graphs (Q2195447) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Parallel graph algorithms for finding weighted matchings and subgraphs in computational science (Q2830821) (← links)
- (Q5289457) (← links)
