Modularity of cycles and paths in graphs

DOI10.1145/103516.103517zbMath0799.68146OpenAlexW2002326865MaRDI QIDQ4302836

Esther M. Arkin, Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/103516.103517

zbMATH Keywords

pathsbipartite graphcyclesgraphsmodularitylinear-time algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (13)

On path lengths modulo three ⋮ Computing matrix period in max--min algebra ⋮ Finding a path with two labels forbidden in group-labeled graphs ⋮ Quick but odd growth of cacti ⋮ Magic Sets and their application to data integration ⋮ Finding induced paths of given parity in claw-free graphs ⋮ A Trichotomy for Regular Trail Queries ⋮ Linear independence in bottleneck algebras ⋮ A trichotomy for regular simple path queries on graphs ⋮ On the powers of matrices in bottleneck/fuzzy algebra ⋮ Strong orientations without even directed circuits ⋮ Unnamed Item ⋮ Cycles of length 0 modulo 4 in graphs

This page was built for publication: Modularity of cycles and paths in graphs