The complexity of broadcasting in planar and decomposable graphs (Q1392535)

From MaRDI portal
Revision as of 08:26, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1166930)
scientific article
Language Label Description Also known as
English
The complexity of broadcasting in planar and decomposable graphs
scientific article

    Statements

    title
    The complexity of broadcasting in planar and decomposable graphs (English)
    0 references
    author
    Andreas Jakoby
    0 references
    publication date
    2 December 1998
    0 references
    zbMATH Keywords
    broadcasting
    0 references
    processor networks
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68M10
    0 references
    05C90
    0 references
    68R10
    0 references
    94C15
    0 references
    zbMATH DE Number
    1180308
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1392535&oldid=22464038"
    Powered by MediaWiki