An efficient algorithm for the density Turán problem of some unicyclic graphs

Halina Bielak, Kamil Powroznik. An efficient algorithm for the density Turán problem of some unicyclic graphs. In Maria Ganzha, Leszek A. Maciaszek, Marcin Paprzycki, editors, Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Warsaw, Poland, September 7-10, 2014. pages 479-486, 2014.

@inproceedings{BielakP14,
  title = {An efficient algorithm for the density Turán problem of some unicyclic graphs},
  author = {Halina Bielak and Kamil Powroznik},
  year = {2014},
  researchr = {https://researchr.org/publication/BielakP14},
  cites = {0},
  citedby = {0},
  pages = {479-486},
  booktitle = {Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Warsaw, Poland, September 7-10, 2014},
  editor = {Maria Ganzha and Leszek A. Maciaszek and Marcin Paprzycki},
  isbn = {978-83-60810-58-3},
}