Go to the corresponding LIPIcs Volume Portal 
Sankowski, Piotr ; Wegrzycki, Karol
pdfformat: 

@InProceedings{sankowski_et_al:LIPIcs:2017:6977, 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)}, pages = {56:156:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770286}, ISSN = {18688969}, year = {2017}, volume = {66}, editor = {Heribert Vollmer and Brigitte ValleĢe}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6977}, URN = {urn:nbn:de:0030drops69773}, doi = {10.4230/LIPIcs.STACS.2017.56}, annote = {Keywords: Frobenius Normal Form, Graph Algorithms, All Nodes Shortest Cycles} }
Keywords:  Frobenius Normal Form, Graph Algorithms, All Nodes Shortest Cycles  
Collection:  34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)  
Issue Date:  2017  
Date of publication:  06.03.2017 