Pages that link to "Item:Q808288"
From MaRDI portal
The following pages link to An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288):
Displaying 7 items.
- Computing transparently: The independent sets in a graph (Q537814) (← links)
- Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- The maximum clique problem (Q1318271) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616) (← links)