Fully dynamic MIS in uniformly sparse graphs (Q4987444)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7342469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic MIS in uniformly sparse graphs |
scientific article; zbMATH DE number 7342469 |
Statements
Fully Dynamic MIS in Uniformly Sparse Graphs (English)
0 references
3 May 2021
0 references
maximal independent set
0 references
dynamic graph algorithms
0 references
edge orientations
0 references
graph arboricity
0 references
0.9929149150848388
0 references
0.906691312789917
0 references
0.8980677127838135
0 references
0.8099314570426941
0 references
0.8051947951316833
0 references
