scientific article; zbMATH DE number 3608053

zbMATH Open0392.05027MaRDI QIDQ4173377FDOQ4173377

Authors: Luděk Kučera 

Publication date: 1977

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

zbMATH Keywords

Expected BehaviorGraph Coloring AlgorithmsPolynomial Procedures

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Cited In (8)

• Complexity analysis of a decentralised graph colouring algorithm
• Randomized parallel algorithms
• Expected complexity of graph partitioning problems
• On the tractability of coloring semirandom graphs
• Graphs with small chromatic numbers are easy to color
• A Simple SVD Algorithm for Finding Hidden Partitions
• Random perturbation of low rank matrices: improving classical bounds
• Coloring k-colorable graphs in constant expected parallel time

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