A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1997.0884 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010583864 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:47, 19 March 2024
scientific article; zbMATH DE number 1098603
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph |
scientific article; zbMATH DE number 1098603 |
Statements
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (English)
0 references
25 May 1998
0 references
randomized parallel algorithm
0 references
