Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. Hemant Chitnis, R., Fomin, F. V., & Golovach, P. A. In Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 79-90, 2013.
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs [link]Paper  bibtex   
@inproceedings{ dblp2260595,
  title = {Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs},
  author = {Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach},
  author_short = {Hemant Chitnis, R. and Fomin, F. V. and Golovach, P. A.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2013},
  key = {dblp2260595},
  id = {dblp2260595},
  biburl = {http://www.dblp.org/rec/bibtex/conf/fsttcs/ChitnisFG13},
  url = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.79},
  conference = {FSTTCS},
  pages = {79-90},
  text = {FSTTCS 2013:79-90},
  booktitle = {Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS)}
}

Downloads: 0