Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2007.10.032
@@ Property / DOI: 10.1016/j.dam.2007.10.032 / rank @@
-Normal rank
@@ 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.1016/j.dam.2007.10.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2072279239
@@ Property / OpenAlex ID: W2072279239 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Q3208690
@@ Property / cites work: Q3208690 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycle covers and the cycle double cover conjecture
+Normal rank
@@ Property / cites work @@
+On the Circuit Cover Problem for Mixed Graphs
@@ Property / cites work: On the Circuit Cover Problem for Mixed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+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 @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Finding a Minimum Cycle Cover of a Graph
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2007.10.032
@@ Property / DOI: 10.1016/J.DAM.2007.10.032 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1003668