Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Complexity of Distributed Greedy Coloring

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

DOI10.1007/978-3-540-75142-7_37zbMath1145.68589OpenAlexW1546043504MaRDI QIDQ3523231

Alfredo Navarra, Adrian Kosowski, Ralf Klasing, Cyril Gavoille

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_37



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)








This page was built for publication: On the Complexity of Distributed Greedy Coloring

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