A parllel algorithm for finding a maximum weight clique of an interval graph (Q582125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4130046 / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel algorithm
Property / zbMATH Keywords: parallel algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel random access machine
Property / zbMATH Keywords: parallel random access machine / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity analysis
Property / zbMATH Keywords: complexity analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
EREW-PRAM
Property / zbMATH Keywords: EREW-PRAM / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum weight clique
Property / zbMATH Keywords: maximum weight clique / rank
 
Normal rank
Property / zbMATH Keywords
 
interval graph
Property / zbMATH Keywords: interval graph / rank
 
Normal rank
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.1016/0167-8191(90)90152-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969414442 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:33, 30 July 2024

scientific article
Language Label Description Also known as
English
A parllel algorithm for finding a maximum weight clique of an interval graph
scientific article

    Statements

    A parllel algorithm for finding a maximum weight clique of an interval graph (English)
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    parallel random access machine
    0 references
    complexity analysis
    0 references
    EREW-PRAM
    0 references
    maximum weight clique
    0 references
    interval graph
    0 references
    0 references