Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation

DOI10.1080/10637190310001633664zbMath1069.68645OpenAlexW1978542700MaRDI QIDQ4820804

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

zbMATH Keywords

HeuristicsParallel AlgorithmsColouring GraphBit Manipulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Parallel integer sorting and simulation amongst CRCW models
• Fast integer merging on the EREW PRAM
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
• PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS

This page was built for publication: Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation