%0 Journal Article %1 journals/corr/abs-cs-0607135 %A Friedland, Shmuel %A Levy, Daniel %D 2006 %J CoRR %K dblp %T A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs %U http://dblp.uni-trier.de/db/journals/corr/corr0607.html#abs-cs-0607135 %V abs/cs/0607135

@article{journals/corr/abs-cs-0607135, added-at = {2018-08-13T00:00:00.000+0200}, author = {Friedland, Shmuel and Levy, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2ab097548e61f20c0f571ad2190570371/dblp}, ee = {http://arxiv.org/abs/cs/0607135}, interhash = {2a7ca5412c5811d7e09e7d019bd6bcc8}, intrahash = {ab097548e61f20c0f571ad2190570371}, journal = {CoRR}, keywords = {dblp}, timestamp = {2018-08-14T13:14:08.000+0200}, title = {A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs}, url = {http://dblp.uni-trier.de/db/journals/corr/corr0607.html#abs-cs-0607135}, volume = {abs/cs/0607135}, year = 2006 }