Cloteaux, B.
(2024),
Graphic Approximation of Integer Sequences, Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, US, [online], https://doi.org/10.1007/978-3-031-62166-6_13
(Accessed January 12, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Graphic Approximation of Integer Sequences
Published
Author(s)
Abstract
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give two new approaches for generating a graphic approximation of the sequence. These schemes are fast, simple to implement, and only require a linear amount of memory. This allows approximation to be performed on very large integer sequences.Proceedings Title
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Volume
462
Conference Dates
March 7-11, 2022
Conference Location
Boca Raton, FL, US
Conference Title
53rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Pub Type
Conferences
Download Paper
Keywords
degree sequence, graph generation, graphic sequences
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created November 25, 2024, Updated December 3, 2024