BibTeX record journals/corr/abs-2306-10182

download as .bib file

@article{DBLP:journals/corr/abs-2306-10182,
  author       = {Hang Liao and
                  Deeparnab Chakrabarty},
  title        = {Learning Spanning Forests Optimally using {CUT} Queries in Weighted
                  Undirected Graphs},
  journal      = {CoRR},
  volume       = {abs/2306.10182},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2306.10182},
  doi          = {10.48550/ARXIV.2306.10182},
  eprinttype    = {arXiv},
  eprint       = {2306.10182},
  timestamp    = {Thu, 22 Jun 2023 16:55:52 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-10182.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.