Computing and Combinatorics
From MaRDI portal
Publication:5716963
DOI10.1007/11533719zbMath1128.05312OpenAlexW4376561447MaRDI QIDQ5716963
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Related Items (16)
On degree-degree correlations in multilayer networks ⋮ Moments of Uniform Random Multigraphs with Fixed Degree Sequences ⋮ Quadratically Regularized Optimal Transport on Graphs ⋮ I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ True scale-free networks hidden by finite size effects ⋮ Maximum likelihood estimation in the \(\beta\)-model ⋮ Enumerating Steiner triple systems ⋮ Unnamed Item ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ A Performance Comparison of Density-of-States Methods ⋮ Density decompositions of networks ⋮ Constrained Markovian dynamics of random graphs
This page was built for publication: Computing and Combinatorics
