An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions
From MaRDI portal
Latest revision as of 14:16, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(O(n\log n)\) algorithm for finding edge span of cacti |
scientific article |
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