An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-015-9827-4 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jco/JanczewskiT16 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9827-4 / rank | |||
Normal rank | |||
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
