Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Bodlaender, H. L., Cygan, M., Kratsch, S., & Nederlof, J. Inf. Comput., 243:86–111, 2015.
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth [link]Paper  doi  bibtex   
@article{DBLP:journals/iandc/BodlaenderCKN15,
  author    = {Hans L. Bodlaender and
               Marek Cygan and
               Stefan Kratsch and
               Jesper Nederlof},
  title     = {Deterministic single exponential time algorithms for connectivity
               problems parameterized by treewidth},
  journal   = {Inf. Comput.},
  volume    = {243},
  pages     = {86--111},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.ic.2014.12.008},
  doi       = {10.1016/j.ic.2014.12.008},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iandc/BodlaenderCKN15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0