论文信息 - Modularity of cycles and paths in graphs

Modularity of cycles and paths in graphs

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 <italic>P</italic> mod <italic>Q</italic> and whether all paths between two specified nodes are of length <italic>P</italic> mod <italic>Q</italic>, for fixed integers <italic>P</italic>.<italic>Q</italic>. These results are compared to those for directed graphs.

[1] Arthur F. Veinott,et al. Computing a graph's period quadratically by node condensation , 1973, Discret. Math..

[2] John Maybee,et al. Qualitative Economics and the Scope of the Correspondence Principle , 1968 .

[3] Kelvin Lancaster,et al. The Scope of Qualitative Economics , 1962 .

[4] Yoshi Ikura. Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95 , 1984, Networks.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[7] Xiaotie Deng,et al. On path lengths modulo three , 1991, J. Graph Theory.

[8] Christos H. Papadimitriou,et al. The even-path problem for graphs and digraphs , 1984, Networks.

[9] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[10] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[11] Carsten Thomassen,et al. Even Cycles in Directed Graphs , 1985, Eur. J. Comb..