On the approximability of the minimum strictly fundamental cycle basis problem (Q629358): Difference between revisions

@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4386084
@@ Property / cites work: Q4386084 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Generating Fundamental Cycles in a Graph
+Normal rank
@@ Property / cites work @@
+Lower-stretch spanning trees
@@ Property / cites work: Lower-stretch spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474081
@@ Property / cites work: Q4474081 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Integral cycle bases for cyclic timetabling
@@ Property / cites work: Integral cycle bases for cyclic timetabling / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of cycle bases
@@ Property / cites work: Classes of cycle bases / rank @@
+Normal rank
@@ Property / cites work @@
+On cycle bases of a graph
@@ Property / cites work: On cycle bases of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank