Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Sankowski, P. & Wegrzycki, K. In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pages 56:1–56:14, 2017.
Improved Distance Queries and Cycle Counting by Frobenius Normal Form [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/stacs/SankowskiW17,
  author       = {Piotr Sankowski and
                  Karol Wegrzycki},
  title        = {Improved Distance Queries and Cycle Counting by Frobenius Normal Form},
  booktitle    = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2017, March 8-11, 2017, Hannover, Germany},
  pages        = {56:1--56:14},
  year         = {2017},
  crossref     = {DBLP:conf/stacs/2017},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2017.56},
  doi          = {10.4230/LIPICS.STACS.2017.56},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/SankowskiW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0