An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs (Q2792985)
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: An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs |
scientific article; zbMATH DE number 6555412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs |
scientific article; zbMATH DE number 6555412 |
Statements
14 March 2016
0 references
design of algorithms
0 references
analysis of algorithms
0 references
independent set
0 references
2-independent set
0 references
Euler tour
0 references
cactus graph
0 references
An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs (English)
0 references
