%0 Journal Article %1 journals/rsa/Haggstrom98 %A Häggström, Olle %D 1998 %J Random Struct. Algorithms %K dblp %N 1 %P 27-50 %T Uniform and minimal essential spanning forests on trees. %U http://dblp.uni-trier.de/db/journals/rsa/rsa12.html#Haggstrom98 %V 12

@article{journals/rsa/Haggstrom98, added-at = {2012-04-14T00:00:00.000+0200}, author = {Häggström, Olle}, biburl = {https://www.bibsonomy.org/bibtex/2f3cce73441bd4c90fa4f01888b8fae67/dblp}, ee = {http://dx.doi.org/10.1002/(SICI)1098-2418(199801)12:1<27::AID-RSA2>3.0.CO;2-V}, interhash = {4c632f9f059f4431b48eef235e041bf5}, intrahash = {f3cce73441bd4c90fa4f01888b8fae67}, journal = {Random Struct. Algorithms}, keywords = {dblp}, number = 1, pages = {27-50}, timestamp = {2012-04-17T11:48:26.000+0200}, title = {Uniform and minimal essential spanning forests on trees.}, url = {http://dblp.uni-trier.de/db/journals/rsa/rsa12.html#Haggstrom98}, volume = 12, year = 1998 }