Hardness and algorithms for rainbow connection (Q491198): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-009-9250-9
@@ Property / DOI: 10.1007/s10878-009-9250-9 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.2493
@@ Property / arXiv ID: 0809.2493 / rank @@
+Normal rank
@@ Property / cites work @@
+The Algorithmic Aspects of the Regularity Lemma
@@ Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
+Normal rank
@@ Property / cites work @@
+On rainbow connection
@@ Property / cites work: On rainbow connection / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Hypergraph Partitioning and Applications
+Normal rank
@@ Property / cites work @@
+Q4200109
@@ Property / cites work: Q4200109 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-009-9250-9
@@ Property / DOI: 10.1007/S10878-009-9250-9 / rank @@
+Normal rank