Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack |
scientific article |
Statements
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (English)
0 references
23 August 2011
0 references
graph algorithms
0 references
irredundance number
0 references
