Recognizing cographs and threshold graphs through a classification of their edges (Q294753): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C75 / 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: 68W10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6594087 / rank
 
Normal rank
Property / zbMATH Keywords
 
cographs
Property / zbMATH Keywords: cographs / rank
 
Normal rank
Property / zbMATH Keywords
 
threshold graphs
Property / zbMATH Keywords: threshold graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
edge classification
Property / zbMATH Keywords: edge classification / rank
 
Normal rank
Property / zbMATH Keywords
 
graph partition
Property / zbMATH Keywords: graph partition / rank
 
Normal rank
Property / zbMATH Keywords
 
recognition
Property / zbMATH Keywords: recognition / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel algorithm
Property / zbMATH Keywords: parallel algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank

Revision as of 20:35, 27 June 2023

scientific article
Language Label Description Also known as
English
Recognizing cographs and threshold graphs through a classification of their edges
scientific article

    Statements

    Recognizing cographs and threshold graphs through a classification of their edges (English)
    0 references
    16 June 2016
    0 references
    cographs
    0 references
    threshold graphs
    0 references
    edge classification
    0 references
    graph partition
    0 references
    recognition
    0 references
    parallel algorithm
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references