Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2011.03.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2011.03.002 / rank | |||
Normal rank | |||
Latest revision as of 23:15, 9 December 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
0 references
