Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:11, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel O(log n) time edge-colouring of trees and Halin graphs |
scientific article |
Statements
Parallel O(log n) time edge-colouring of trees and Halin graphs (English)
0 references
1988
0 references
parallel computation
0 references
edge-colouring
0 references
trees
0 references
PRAM
0 references
Halin graphs
0 references
Hamiltonian cycle
0 references
