scientific article

zbMath1190.05091MaRDI QIDQ3574980

Johan Wästlund

Publication date: 5 July 2010

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

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

zbMATH Keywords

random treeminimum matching

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Stochastic scheduling theory in operations research (90B36) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

First passage percolation on random graphs with finite mean degrees ⋮ Random assignment problems ⋮ Edge flows in the complete random-lengths network ⋮ Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms

This page was built for publication: