Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.
Alan GibbonsAmos IsraeliWojciech RytterPublished in: Inf. Process. Lett. (1988)
Keyphrases
- weighted graph
- decision trees
- undirected graph
- graph matching
- graph structure
- minimum spanning trees
- lower bound
- graph partitioning
- labeled trees
- parallel processing
- edge detection
- graph theoretic
- tree structured data
- edge detector
- graph theory
- graph databases
- image processing
- parallel computing
- graph representation
- tree structures
- tree models
- labeled graphs
- adjacency graph