scientific article

zbMath1192.68972MaRDI QIDQ3576761

Andreas Weißl, Konstantinos D. Panagiotou

Publication date: 2 August 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0112/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generating functionssampling algorithmsrandom graphs with structural constraints

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

The maximum degree of random planar graphs ⋮ A probabilistic approach to block sizes in random maps ⋮ Vertices of Degree k in Random Unlabeled Trees

This page was built for publication: