scientific article
From MaRDI portal
Publication:3942995
zbMath0484.05055MaRDI QIDQ3942995
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Switchings Constrained to 2-Connectivity in Simple Graphs ⋮ Exactly scale-free scale-free networks ⋮ Unnamed Item ⋮ Firm-network characteristics and economic robustness to natural disasters ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs ⋮ The flip Markov chain for connected regular graphs ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ Empirical spectral distributions of sparse random graphs ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ Fast Sequential Creation of Random Realizations of Degree Sequences ⋮ A triangle process on regular graphs
This page was built for publication:
