Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack |
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
0 references
