scientific article; zbMATH DE number 3608053

zbMath0392.05027MaRDI QIDQ4173377

Luděk Kučera

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Expected BehaviorGraph Coloring AlgorithmsPolynomial Procedures

Mathematics Subject Classification ID

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

Related Items (7)

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

This page was built for publication: