Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804): Difference between revisions

@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Approximation of Distances in Graphs
@@ Property / cites work: Faster Approximation of Distances in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing cycles in undirected graphs
@@ Property / cites work: Packing cycles in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+All-Pairs Small-Stretch Paths
@@ Property / cites work: All-Pairs Small-Stretch Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934691
@@ Property / cites work: Q2934691 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754199
@@ Property / cites work: Q2754199 / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+New Approximation Algorithms for Minimum Cycle Bases of Graphs
+Normal rank
@@ Property / cites work @@
+Q2921712
@@ Property / cites work: Q2921712 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint Cycles: Integrality Gap, Hardness, and Approximation
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Finding a maximum weight triangle in n             <sup>3-Δ</sup>             time, with applications
+Normal rank
@@ Property / cites work @@
+Finding Even Cycles Even Faster
@@ Property / cites work: Finding Even Cycles Even Faster / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501266
@@ Property / cites work: Q5501266 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank