Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
DOI10.1080/10637190310001633664zbMATH Open1069.68645OpenAlexW1978542700MaRDI QIDQ4820804FDOQ4820804
Authors: Neelam Bhalla
Publication date: 1 October 2004
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637190310001633664
Recommendations
- scientific article; zbMATH DE number 3935077
- scientific article; zbMATH DE number 17674
- A parallel variant of a heuristical algorithm for graph colouring
- On graph coloring in a class of parallel local algorithms
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (4)
This page was built for publication: Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820804)