Modularity of cycles and paths in graphs

Authors:
E. M. Arkin;C. H. Papadimitriou;M. Yannakakis
Affiliations:
Cornell Univ., Ithaca, NY;Univ. of California at San Diego, La Jolla;AT&T Bell Labs., Short Hills, NJ
Venue:
Journal of the ACM (JACM)
Year:
1991

Citing 3
Cited 5

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
On path lengths modulo three

Journal of Graph Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On Datalog vs. polynomial time (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Magic Sets and their application to data integration

Journal of Computer and System Sciences
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM (JACM)
Finding an induced path of given parity in planar graphs in polynomial time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A trichotomy for regular simple path queries on graphs

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

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.