An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767)
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 \(O(n\log n)\) algorithm for finding edge span of cacti |
scientific article; zbMATH DE number 6579231
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n\log n)\) algorithm for finding edge span of cacti |
scientific article; zbMATH DE number 6579231 |
Statements
An \(O(n\log n)\) algorithm for finding edge span of cacti (English)
0 references
11 May 2016
0 references
cacti
0 references
edge span
0 references
vertex coloring
0 references
0 references
