Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-44543-4_22
+Normal rank
@@ Property / OpenAlex ID @@
+W2531766656
@@ Property / OpenAlex ID: W2531766656 / rank @@
+Normal rank
@@ Property / cites work @@
+On the multiway cut polyhedron
@@ Property / cites work: On the multiway cut polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
+Normal rank
@@ Property / cites work @@
+Q4931752
@@ Property / cites work: Q4931752 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Homomorphism Problems
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of homophyly of networks
@@ Property / cites work: Algorithmic aspects of homophyly of networks / rank @@
+Normal rank