Affordable Access

Publisher Website

A finite-difference sieve to count paths and cycles by length

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier BV
Publication Date
Volume
60
Issue
4
Identifiers
DOI: 10.1016/s0020-0190(96)00159-7
Keywords
  • Algorithms
  • Combinatorial Problems
Disciplines
  • Computer Science

Abstract

Abstract We present algorithms to count paths and cycles of a given length in a directed graph. The algorithms have time complexity O(2 n poly n) and space complexity O(poly n).

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Algorithms to count paths and cycles

on Information Processing Letters Jan 01, 1994

Relative lengths of paths and cycles ink-connected...

on Journal of Combinatorial Theor... Jan 01, 1982

Cycles and paths of many lengths in bipartite digr...

on Journal of Combinatorial Theor... Jan 01, 1990
More articles like this..