scientific article; zbMATH DE number 4049082

MaRDI QIDQ3785972zbMATH OpenFDO

Authors O. A. Ogunyode

Publication date 1987

zbMATH Keywords

edge-chromatic numberedge-colouringparallel algorithmsprobabilistic algorithmSIMD parallel computersimple graphs

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel algorithms for the edge-coloring and edge-coloring update problems
• scientific article; zbMATH DE number 17674
• Very fast parallel algorithms for approximate edge coloring
• scientific article; zbMATH DE number 4047152
• Efficient parallel algorithms for edge coloring problems

Cited in

(20)

• Parallel O(log n) time edge-colouring of trees and Halin graphs
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
• A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
• A parallel variant of a heuristical algorithm for graph colouring
• Parallel concepts in graph theory
• Fast parallel edge colouring of graphs.
• Parallel algorithms for the edge-coloring and edge-coloring update problems
• A simple and fast heuristic algorithm for edge-coloring of graphs
• scientific article; zbMATH DE number 1696533 (Why is no real title available?)
• A parallel algorithm for solving the coloring problem on trapezoid graphs
• scientific article; zbMATH DE number 4047152 (Why is no real title available?)
• Efficient parallel algorithms for edge coloring problems
• A fast parallel algorithm to color a graph with Δ colors
• scientific article; zbMATH DE number 17674 (Why is no real title available?)
• scientific article; zbMATH DE number 637289 (Why is no real title available?)
• scientific article; zbMATH DE number 1759462 (Why is no real title available?)
• scientific article; zbMATH DE number 2090688 (Why is no real title available?)
• Parallel vertex colouring of interval graphs
• Very fast parallel algorithms for approximate edge coloring
• Optimally edge-colouring outerplanar graphs is in NC

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785972)