Pages that link to "Item:Q5002779"
From MaRDI portal
The following pages link to NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779):
Displaying 7 items.
- An efficient NC algorithm for approximate maximum weight matching (Q2864855) (← links)
- (Q3732972) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Constrained read-once refutations in UTVPI constraint systems: a parallel perspective (Q6620016) (← links)