All maximal independent sets and dynamic dominance for sparse graphs (Q2930264)
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 6370603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All maximal independent sets and dynamic dominance for sparse graphs |
scientific article; zbMATH DE number 6370603 |
Statements
All maximal independent sets and dynamic dominance for sparse graphs (English)
0 references
18 November 2014
0 references
combinatorial enumeration
0 references
bounded degree graphs
0 references
dominating sets
0 references
dynamic graph algorithms
0 references
maximal independent sets
0 references
minor-closed graph families
0 references
reverse search
0 references
sparse graphs
0 references
0.99999964
0 references
0.9085544
0 references
0.9085544
0 references
0 references
0.89445543
0 references
0.89444256
0 references
0.8935057
0 references
0.8934967
0 references
