Random interval graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199807)12:4<361::AID-RSA4>3.0.CO;2-R" /><361::AID-RSA4>3.0.CO;2-R 10.1002/(SICI)1098-2418(199807)12:4<361::AID-RSA4>3.0.CO;2-RzbMath0962.60098OpenAlexW2071142445MaRDI QIDQ4705317

Nicholas J. Pippenger

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199807)12:4<361::aid-rsa4>3.0.co;2-r

zbMATH Keywords

M/M/\(\infty\)stochastic service systemsM/D/\(\infty\)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Queueing theory (aspects of probability theory) (60K25)

Related Items (5)

Random subcube intersection graphs. I: Cliques and covering ⋮ Stochastic service systems, random interval graphs and search algorithms ⋮ A Model for Birdwatching and other Chronological Sampling Activities ⋮ Interval graph limits ⋮ On the typical case complexity of graph optimization

This page was built for publication: Random interval graphs