On graph coloring in a class of parallel local algorithms

DOI10.1134/S1995423911030013MaRDI QIDQ5407686zbMATH OpenOpenAlexFDO

Authors V. A. Evstigneev, Y. Tursunbaj Kyzy

Publication date 7 April 2014

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995423911030013

zbMATH Keywords

\(T\)-coloring\(w\)-perfect graphdistributed algorithmgraph coloringgreedy algorithmlocal algorithmsum coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Euro-Par 2004 Parallel Processing
• Local optimization of colorings of graphs
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
• A Parallel Graph Coloring Heuristic
• scientific article; zbMATH DE number 3841898

Cited in

(9)

• A parallel variant of a heuristical algorithm for graph colouring
• Vertex coloring with communication and local memory constraints in synchronous broadcast networks
• Simple decentralized graph coloring
• scientific article; zbMATH DE number 1696533 (Why is no real title available?)
• Local optimization of colorings of graphs
• Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
• Euro-Par 2004 Parallel Processing
• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
• Local Algorithms for Edge Colorings in UDGs

This page was built for publication: On graph coloring in a class of parallel local algorithms

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