Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation (Q4820804): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10637190310001633664 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978542700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast integer merging on the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel integer sorting and simulation amongst CRCW models / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:03, 7 June 2024

scientific article; zbMATH DE number 2104801
Language Label Description Also known as
English
Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
scientific article; zbMATH DE number 2104801

    Statements

    Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation (English)
    0 references
    0 references
    1 October 2004
    0 references
    Parallel Algorithms
    0 references
    Colouring Graph
    0 references
    Bit Manipulation
    0 references
    Heuristics
    0 references

    Identifiers