Thomas Erlebach, Alexander Hall, Matús Mihalák. Approximate Discovery of Random Graphs. In Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer, editors, Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Volume 4665 of Lecture Notes in Computer Science, pages 82-92, Springer, 2007. [doi]
@inproceedings{ErlebachHM07,
title = {Approximate Discovery of Random Graphs},
author = {Thomas Erlebach and Alexander Hall and Matús Mihalák},
year = {2007},
doi = {10.1007/978-3-540-74871-7_8},
url = {http://dx.doi.org/10.1007/978-3-540-74871-7_8},
tags = {discovery, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ErlebachHM07},
cites = {0},
citedby = {0},
pages = {82-92},
booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings},
editor = {Juraj Hromkovic and Richard Královic and Marc Nunkesser and Peter Widmayer},
volume = {4665},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74870-0},
}