BibTeX record journals/tcs/LiFJZ18

download as .bib file

@article{DBLP:journals/tcs/LiFJZ18,
  author       = {Xingfu Li and
                  Haodi Feng and
                  Haitao Jiang and
                  Binhai Zhu},
  title        = {Solving the maximum internal spanning tree problem on interval graphs
                  in polynomial time},
  journal      = {Theor. Comput. Sci.},
  volume       = {734},
  pages        = {32--37},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.09.017},
  doi          = {10.1016/J.TCS.2017.09.017},
  timestamp    = {Wed, 26 Jan 2022 22:09:57 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiFJZ18.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.