Max-coloring paths: tight bounds and extensions (Q454245): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-010-9290-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2004394201
@@ Property / OpenAlex ID: W2004394201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+On the max coloring problem
@@ Property / cites work: On the max coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted coloring: further complexity and approximability results
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+A coloring problem for weighted graphs
@@ Property / cites work: A coloring problem for weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Batch Coloring Flat Graphs and Thin
@@ Property / cites work: Batch Coloring Flat Graphs and Thin / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+A class of algorithms which require nonlinear time to maintain disjoint sets
+Normal rank