An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59472539, #quickstatements; #temporary_batch_1706974296281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59472539 / rank | |||
Normal rank | |||
Revision as of 16:50, 3 February 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
