Journal ArticleOPEN ACCESS

Modularity of Cycles and Paths in Graphs

Journal of the ACM (JACM) (1991) 38(2) 255-274
DOI: 10.1145/103516.103517
30Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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 directed graphs. © 1991, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Arkin, E. M., Papadimitriou, C. H., & Yannakakis, M. (1991). Modularity of Cycles and Paths in Graphs. Journal of the ACM (JACM), 38(2), 255–274. https://doi.org/10.1145/103516.103517

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free