Computational Complexity of Traffic Hijacking under BGP and S-BGP (Q3167036)

From MaRDI portal
Revision as of 05:57, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computational Complexity of Traffic Hijacking under BGP and S-BGP
scientific article

    Statements

    title
    Computational Complexity of Traffic Hijacking under BGP and S-BGP (English)
    0 references
    author
    Marco Chiesa
    0 references
    Giuseppe Di Battista
    0 references
    Erlebach, Thomas
    0 references
    Maurizio Patrignani
    0 references
    publication date
    1 November 2012
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68M11
    0 references
    68M12
    0 references
    zbMATH DE Number
    6101168
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3167036&oldid=16420138"
    Powered by MediaWiki