You are already at the latest version With random graph generation, most of the previously described algorithms were not related to graphs arising in any particular subject area, so in this paper we generate random graphs for a specific area, namely, models of real communication networks. In the paper we propose a method that determines the “best” invariant; the corresponding basic algorithm is as follows.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Boris
Contact Boris, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack