Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Fomin, F. V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., & Wrochna, M. CoRR, 2015.
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth [link]Paper  bibtex   
@article{ dblp1750291,
  title = {Fully polynomial-time parameterized computations for graphs and matrices of low treewidth},
  author = {Fedor V. Fomin and Daniel Lokshtanov and Michal Pilipczuk and Saket Saurabh and Marcin Wrochna},
  author_short = {Fomin, F. V. and Lokshtanov, D. and Pilipczuk, M. and Saurabh, S. and Wrochna, M.},
  bibtype = {article},
  type = {article},
  year = {2015},
  key = {dblp1750291},
  id = {dblp1750291},
  biburl = {http://www.dblp.org/rec/bibtex/journals/corr/FominLPSW15},
  url = {http://arxiv.org/abs/1511.01379},
  journal = {CoRR},
  volume = {abs/1511.01379},
  text = {CoRR abs/1511.01379 (2015)}
}

Downloads: 0