Finding even cycles even faster

DOI10.1007/3-540-58201-0_96zbMath1422.05098OpenAlexW1598262541WikidataQ60299184 ScholiaQ60299184MaRDI QIDQ4632454

Uri Zwick, Raphael Yuster

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_96

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Improved distance queries and cycle counting by Frobenius normal form ⋮ Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

Cites Work

• The complexity of determining a shortest cycle of even length
• Even cycles in directed graphs
• Cycles of even length in graphs
• Color-coding
• Finding a Minimum Circuit in a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding even cycles even faster