Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/approx/Coja-OghlanMS04
%A Coja-Oghlan, Amin
%A Moore, Cristopher
%A Sanwalani, Vishal
%B APPROX-RANDOM
%D 2004
%E Jansen, Klaus
%E Khanna, Sanjeev
%E Rolim, José D. P.
%E Ron, Dana
%I Springer
%K dblp
%P 322-333
%T Counting Connected Graphs and Hypergraphs via the Probabilistic Method.
%U http://dblp.uni-trier.de/db/conf/approx/approx2004.html#Coja-OghlanMS04
%V 3122
%@ 3-540-22894-2
@inproceedings{conf/approx/Coja-OghlanMS04,
added-at = {2022-01-03T00:00:00.000+0100},
author = {Coja-Oghlan, Amin and Moore, Cristopher and Sanwalani, Vishal},
biburl = {https://www.bibsonomy.org/bibtex/2dc7e168f0c5a63009bd50cb2bce9d663/dblp},
booktitle = {APPROX-RANDOM},
crossref = {conf/approx/2004},
editor = {Jansen, Klaus and Khanna, Sanjeev and Rolim, José D. P. and Ron, Dana},
ee = {https://doi.org/10.1007/978-3-540-27821-4_29},
interhash = {e92639cc027d66d47d7cbd2ee0ee2638},
intrahash = {dc7e168f0c5a63009bd50cb2bce9d663},
isbn = {3-540-22894-2},
keywords = {dblp},
pages = {322-333},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T00:33:57.000+0200},
title = {Counting Connected Graphs and Hypergraphs via the Probabilistic Method.},
url = {http://dblp.uni-trier.de/db/conf/approx/approx2004.html#Coja-OghlanMS04},
volume = 3122,
year = 2004
}
