scientific article; zbMATH DE number 3608053

MaRDI QIDQ4173377zbMATH OpenFDO

Authors Luděk Kučera

Publication date 1977

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)

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

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)