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

A range-compaction heuristic for graph coloring

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

DOI10.1023/B:HEUR.0000012448.70007.32zbMath1081.68068MaRDI QIDQ1430046

Richard Hughey, Andrea Di Blas, Arun K. Jagota

Publication date: 27 May 2004

Published in: Journal of Heuristics (Search for Journal in Brave)


zbMATH Keywords

graph coloringDIMACS benchmarksiterative-greedy algorithm


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (1)

Spectrum graph coloring and applications to Wi-Fi channel assignment







This page was built for publication: A range-compaction heuristic for graph coloring

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