Detecting directed 4-cycles still faster

DOI10.1016/S0020-0190(03)00252-7zbMath1175.68187OpenAlexW2069463493MaRDI QIDQ1014385

Friedrich Eisenbrand, Fabrizio Grandoni

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00252-7

zbMATH Keywords

algorithmscomputational complexitydirected 4-cycle

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Counting Homomorphic Cycles in Degenerate Graphs

Cites Work

• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• Matrix multiplication via arithmetic progressions
• Fast rectangular matrix multiplication and applications
• Finding a Minimum Circuit in a Graph
• Finding Even Cycles Even Faster
• Color-coding