Pages that link to "Item:Q987804"

The following pages link to Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804):

Displaying 13 items.

• A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
• An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
• Listing all fixed-length simple cycles in sparse graphs in optimal time (Q1679990) (← links)
• A shortest cycle for each vertex of a graph (Q1944201) (← links)
• An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs (Q2826672) (← links)
• Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs (Q2921428) (← links)
• Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
• Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
• Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs (Q4990395) (← links)
• (Q5091203) (← links)
• (Q5111456) (← links)
• (Q5743440) (← links)
• Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)