Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Graph coloring in a class of parallel local algorithms

From MaRDI portal
Publication:5407686
Jump to:navigation, search

DOI10.1134/S1995423911030013zbMath1299.68043OpenAlexW2009395349MaRDI QIDQ5407686

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

greedy algorithmgraph coloring\(T\)-coloringdistributed algorithmsum coloringlocal algorithm\(w\)-perfect graph


Mathematics Subject Classification ID

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








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5407686&oldid=20147053"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 02:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki