scientific article; zbMATH DE number 747036
From MaRDI portal
Publication:4697457
zbMath0819.05052MaRDI QIDQ4697457
Brendan D. McKay, Alistair Sinclair, Mark R. Jerrum
Publication date: 27 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
degree sequencelabelled graphsgraphical sequencepolynomial-time probabilistic algorithms\(P\)-stable class
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items
Improving the characterization of P-stability for applications in network privacy, Approximating degree sequences with regular graphic sequences (extended abstract), Mixing time of the switch Markov chain and stable degree sequences, A sequential algorithm for generating random graphs, Approximate sampling of graphs with near-\(P\)-stable degree intervals, The switch Markov chain for sampling irregular graphs and digraphs, The mixing time of switch Markov chains: a unified approach, How likely is an LLD degree sequence to be graphical?, Half-graphs, other non-stable degree sequences, and the switch Markov chain, Matrices with prescribed row and column sums, Counting Perfect Matchings and the Switch Chain, Graphic sequences, distances and \(k\)-degree anonymity
