An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-015-9827-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101461335 / rank | |||
Normal rank | |||
Revision as of 19:29, 19 March 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
