By the same authors

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length

Research output: Contribution to journalArticlepeer-review

Standard

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. / Giscard, Pierre-Louis; Kriege, Nils; Wilson, Richard Charles.

In: Algorithmica, 15.02.2019.

Research output: Contribution to journalArticlepeer-review

Harvard

Giscard, P-L, Kriege, N & Wilson, RC 2019, 'A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length', Algorithmica.

APA

Giscard, P-L., Kriege, N., & Wilson, R. C. (2019). A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Algorithmica.

Vancouver

Giscard P-L, Kriege N, Wilson RC. A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Algorithmica. 2019 Feb 15.

Author

Giscard, Pierre-Louis ; Kriege, Nils ; Wilson, Richard Charles. / A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. In: Algorithmica. 2019.

Bibtex - Download

@article{c79c824daab44005ba0d5b51d4079a59,
title = "A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length",
author = "Pierre-Louis Giscard and Nils Kriege and Wilson, {Richard Charles}",
note = "{\textcopyright} Springer Science+Business Media, LLC, part of Springer Nature 2019. This is an author-produced version of the published paper. Uploaded in accordance with the publisher{\textquoteright}s self-archiving policy. Further copying may not be permitted; contact the publisher for details.",
year = "2019",
month = feb,
day = "15",
language = "English",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length

AU - Giscard, Pierre-Louis

AU - Kriege, Nils

AU - Wilson, Richard Charles

N1 - © Springer Science+Business Media, LLC, part of Springer Nature 2019. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

PY - 2019/2/15

Y1 - 2019/2/15

M3 - Article

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

ER -