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

A parallel variant of a heuristical algorithm for graph colouring

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

DOI10.1016/0167-8191(90)90122-PzbMath0686.68057OpenAlexW2133299993MaRDI QIDQ1262783

Janez Žerovnik

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90122-p


zbMATH Keywords

combinatorial problemgraph colouringparallel algorithmantivoter modelrandomised heuristical algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

A randomized algorithm for \(k\)-colorability






This page was built for publication: A parallel variant of a heuristical algorithm for graph colouring

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1262783&oldid=13360991"
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 09:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki