An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6579231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8045722842216492
0 references
0.785021185874939
0 references
0.7696391344070435
0 references
0.7674727439880371
0 references
0.76610267162323
0 references
