Coloring in sublinear time

DOI10.1007/3-540-63397-9_30MaRDI QIDQ826110zbMATH OpenOpenAlexFDO

Authors Andreas Nolte, Rainer Schrader

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_30

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A Spectral Technique for Coloring Random 3-Colorable Graphs
• Algorithms for Colouring Random k-colourable Graphs
• scientific article; zbMATH DE number 1962838
• Simulated annealing and its problems to color graphs
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Coloring in sublinear time

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