Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation

DOI10.1080/10637190310001633664MaRDI QIDQ4820804zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

HeuristicsParallel AlgorithmsColouring GraphBit Manipulation

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1848398 (Why is no real title available?)
• Fast integer merging on the EREW PRAM
• Parallel integer sorting and simulation amongst CRCW models
• Parallel vertex colouring of interval graphs
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms

Cited in

(4)

• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• A parallel variant of a heuristical algorithm for graph colouring
• scientific article; zbMATH DE number 3935077 (Why is no real title available?)
• Computing with light: toward parallel Boolean algebra

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)