scientific article; zbMATH DE number 3841898

zbMATH Open0531.05035MaRDI QIDQ3312261FDOQ3312261

Authors: Marek Kubale 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• Numerical experiences with graph coloring algorithms
• Some sequential graph colouring algorithms
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
• scientific article; zbMATH DE number 764415
• scientific article; zbMATH DE number 17674

zbMATH Keywords

sequential coloringorderings of vertices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• Title not available (Why is that?)
• On graph coloring in a class of parallel local algorithms
• Title not available (Why is that?)
• Interval vertex-coloring of a graph with forbidden colors
• Graph colouring algorithms
• Worst case analysis of a graph coloring algorithm
• Title not available (Why is that?)
• A theoretical analysis of backtracking in the graph coloring problem
• Smallest-last ordering and clustering and graph coloring algorithms
• The smallest hard-to-color graph for the SL algorithm
• Numerical experiences with graph coloring algorithms

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 Q3312261)