Pages that link to "Item:Q672378"
From MaRDI portal
The following pages link to Using maximal independent sets to solve problems in parallel (Q672378):
Displaying 7 items.
- Parallelism and the maximal path problem (Q1098641) (← links)
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- Parallel algorithms for maximal acyclic sets (Q1386369) (← links)
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches (Q1708174) (← links)
- A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS (Q5249021) (← links)
- The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)
- NC algorithms for partitioning sparse graphs into induced forests with an application (Q6487991) (← links)