Complexity results for weighted timed event graphs (Q429654): 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: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048235 / rank
 
Normal rank
Property / zbMATH Keywords
 
weighted timed event graphs
Property / zbMATH Keywords: weighted timed event graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
throughput
Property / zbMATH Keywords: throughput / rank
 
Normal rank
Property / zbMATH Keywords
 
buffer requirement
Property / zbMATH Keywords: buffer requirement / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank

Revision as of 22:35, 29 June 2023

scientific article
Language Label Description Also known as
English
Complexity results for weighted timed event graphs
scientific article

    Statements

    Complexity results for weighted timed event graphs (English)
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    weighted timed event graphs
    0 references
    throughput
    0 references
    buffer requirement
    0 references
    complexity
    0 references
    approximation algorithm
    0 references

    Identifiers