BibTeX record conf/faw/LiFJZ16

• > Home > conf/faw/LiFJZ16

@inproceedings{DBLP:conf/faw/LiFJZ16,
  author       = {Xingfu Li and
                  Haodi Feng and
                  Haitao Jiang and
                  Binhai Zhu},
  editor       = {Daming Zhu and
                  Sergey Bereg},
  title        = {A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum
                  Number of Internal Vertices on Interval Graphs},
  booktitle    = {Frontiers in Algorithmics, 10th International Workshop, {FAW} 2016,
                  Qingdao, China, June 30- July 2, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9711},
  pages        = {92--101},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-39817-4\_10},
  doi          = {10.1007/978-3-319-39817-4\_10},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/faw/LiFJZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}