Packing non-returning \(A\)-paths algorithmically (Q2476288): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.07.073
+Normal rank
@@ Property / OpenAlex ID @@
+W2078338457
@@ Property / OpenAlex ID: W2078338457 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
+Normal rank
@@ Property / cites work @@
+Packing non-zero \(A\)-paths in group-labelled graphs
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5508779
@@ Property / cites work: Q5508779 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid matching and some applications
@@ Property / cites work: Matroid matching and some applications / rank @@
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl kreuzungsfreier H-Wege
@@ Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank @@
+Normal rank
@@ Property / cites work @@
+Packing non-returning A-paths
@@ Property / cites work: Packing non-returning A-paths / rank @@
+Normal rank