Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1107328 |
scientific article; zbMATH DE number 4064515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel O(log n) time edge-colouring of trees and Halin graphs |
scientific article; zbMATH DE number 4064515 |
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
0.8667057156562805
0 references
0.8444259762763977
0 references
