Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-38919-2_21
+Normal rank
@@ Property / OpenAlex ID @@
+W3000485278
@@ Property / OpenAlex ID: W3000485278 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965980
@@ Property / cites work: Q2965980 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of some minimum label problems
+Normal rank
@@ Property / cites work @@
+Maximum cuts in edge-colored graphs
@@ Property / cites work: Maximum cuts in edge-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4663414
@@ Property / cites work: Q4663414 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-colored graphs with applications to homogeneous faults
+Normal rank
@@ Property / cites work @@
+The label cut problem with respect to path length and label frequency
+Normal rank