The following pages link to Finding even cycles even faster (Q4632454):
Displaying 4 items.
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)