Categories and Subject Descriptors: F.2.m [Analysis of Algorithms and Problem Complexity]: Miscellaneous; G.2.2 [Discrete Mathematics]: Graph Theory -- network problems, path and circuit problems
General Terms: Algorithms, Theory
Additional Key Words and Phrases: Algorithms, cycles and paths, graphs, modularity
Selected papers that cite this one
- Foto Afrati, Stavros S. Cosmadakis, and Mihalis Yannakakis. On Datalog vs polynomial time. Journal of Computer and System Sciences, 51(2):177-196, October 1995.
- Anna Galluccio and Martin Loebl. Cycles of prescribed modularity in planar digraphs. Journal of Algorithms, 21(1):51-70, July 1996.