Pages that link to "Item:Q913519"
From MaRDI portal
The following pages link to Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519):
Displaying 8 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Parallel algorithms for maximal acyclic sets (Q1386369) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Simplification of FEM-Models on Cell BE (Q5189423) (← links)
- Theoretical Computer Science (Q5897355) (← links)