Periodic scheduling of marked graphs using balanced binary words (Q1758156)

From MaRDI portal
Revision as of 21:08, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Periodic scheduling of marked graphs using balanced binary words
scientific article

    Statements

    title
    Periodic scheduling of marked graphs using balanced binary words (English)
    0 references
    author
    Jean-Vivien Millo
    0 references
    Robert de Simone
    0 references
    publication date
    8 November 2012
    0 references
    Mathematics Subject Classification ID
    68M20
    0 references
    68M10
    0 references
    68R10
    0 references
    68R05
    0 references
    zbMATH DE Number
    6103616
    0 references
    zbMATH Keywords
    connected marked graphs
    0 references
    scheduling graphs
    0 references
    balanced binary word
    0 references
    OpenAlex ID
    W2033599628
    0 references
    arXiv ID
    1202.4912
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1758156&oldid=35306524"
    Powered by MediaWiki