Pages that link to "Item:Q3136616"
From MaRDI portal
The following pages link to An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616):
Displaying 5 items.
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
- A parallel algorithm for computing the critical independence number and related sets (Q5415703) (← links)