Counting strongly-connected, moderately sparse directed graphs (Q2844082)

From MaRDI portal
Revision as of 08:45, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Counting strongly-connected, moderately sparse directed graphs
scientific article

    Statements

    title
    Counting strongly-connected, moderately sparse directed graphs (English)
    0 references
    publication date
    27 August 2013
    0 references
    zbMATH Keywords
    enumeration
    0 references
    directed graphs
    0 references
    strongly connected
    0 references
    asymptotics
    0 references
    author
    Boris G. Pittel
    0 references

    Identifiers

    DOI
    10.1002/rsa.20433
    0 references
    Mathematics Subject Classification ID
    05C30
    0 references
    05C40
    0 references
    05C20
    0 references
    zbMATH DE Number
    6202171
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2844082&oldid=27291182"
    Powered by MediaWiki