Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (Q2934329): 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.1145/1400751.1400757 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987125980 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition |
scientific article |
Statements
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (English)
0 references
12 December 2014
0 references
arboricity
0 references
coloring
0 references
forests decomposition
0 references
MIS
0 references
\textsc{Maximal Independent Set}
0 references
