Svante Janson, Johan Wästlund. Addendum to The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph . Random Struct. Algorithms, 28(4):511-512, 2006. [doi]
@article{JansonW06,
title = {Addendum to The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph },
author = {Svante Janson and Johan Wästlund},
year = {2006},
doi = {10.1002/rsa.20122},
url = {http://dx.doi.org/10.1002/rsa.20122},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/JansonW06},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {28},
number = {4},
pages = {511-512},
}