Modularity of cycles and paths in graphs (original) (raw)

Journal of the ACM, 1991

Abstract

Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length P mod Q and whether all paths between two specified nodes are of length P mod Q, for fixed integers P.Q. These results are compared to those for

Esther Arkin hasn't uploaded this paper.

Let Esther know you want this paper to be uploaded.

Ask for this paper to be uploaded.