An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Robert Janczewski / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6579231 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cacti | |||
| Property / zbMATH Keywords: cacti / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge span | |||
| Property / zbMATH Keywords: edge span / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex coloring | |||
| Property / zbMATH Keywords: vertex coloring / rank | |||
Normal rank | |||
Revision as of 17:44, 27 June 2023
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
