Pages that link to "Item:Q1109576"
From MaRDI portal
The following pages link to A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576):
Displaying 5 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005) (← links)