BibTeX record journals/corr/abs-1808-06199

download as .bib file

@article{DBLP:journals/corr/abs-1808-06199,
  author       = {Mikhail V. Goubko and
                  Alexander V. Kuznetsov},
  title        = {Lower bound for the cost of connecting tree with given vertex degree
                  sequence},
  journal      = {CoRR},
  volume       = {abs/1808.06199},
  year         = {2018},
  url          = {http://arxiv.org/abs/1808.06199},
  eprinttype    = {arXiv},
  eprint       = {1808.06199},
  timestamp    = {Tue, 21 Sep 2021 09:44:16 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1808-06199.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.