Rural postman parameterized by the number of components of required edges (Q314816): Difference between revisions

@@ Property / cites work @@
+Q5687196
@@ Property / cites work: Q5687196 / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5271449
@@ Property / cites work: Q5271449 / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Eulerian Extension
@@ Property / cites work: Efficient Algorithms for Eulerian Extension / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4510100
@@ Property / cites work: Q4510100 / rank @@
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part II: The Rural Postman Problem
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Some Postman Problems
+Normal rank
@@ Property / cites work @@
+Solving SCS for bounded length strings in fewer than \(2^n\) steps
+Normal rank
@@ Property / cites work @@
+On Eulerian extensions and their application to no-wait flowshop scheduling
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+On general routing problems
@@ Property / cites work: On general routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of edge traversing
@@ Property / cites work: On the complexity of edge traversing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542181
@@ Property / cites work: Q4542181 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+From Few Components to an Eulerian Graph by Adding Arcs
+Normal rank
@@ Property / cites work @@
+A New View on Rural Postman Based on Eulerian Extension and Matching
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank