Pages that link to "Item:Q1072703"
From MaRDI portal
The following pages link to Lower bounds on parallel algorithms for finding the first maximal independent set (Q1072703):
Displaying 7 items.
- Using maximal independent sets to solve problems in parallel (Q672378) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616) (← links)
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- A parallel algorithm for computing the critical independence number and related sets (Q5415703) (← links)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)