Packing non-zero $A$-paths via matroid matching (Q317424): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C78
@@ Property / Mathematics Subject Classification ID: 05C78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6631749
@@ Property / zbMATH DE Number: 6631749 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+disjoint paths
@@ Property / zbMATH Keywords: disjoint paths / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(A\)-path
@@ Property / zbMATH Keywords: \(A\)-path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+group-labeled graph
@@ Property / zbMATH Keywords: group-labeled graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matroid matching
@@ Property / zbMATH Keywords: matroid matching / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+frame matroid
@@ Property / zbMATH Keywords: frame matroid / 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.2016.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2467002039
@@ Property / OpenAlex ID: W2467002039 / 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 @@
+Q4819371
@@ Property / cites work: Q4819371 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Matroid Property Algorithms
@@ Property / cites work: Complexity of Matroid Property Algorithms / 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 @@
+Q3934404
@@ Property / cites work: Q3934404 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / 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 @@
+Q5390304
@@ Property / cites work: Q5390304 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing non-returning A-paths
@@ Property / cites work: Packing non-returning A-paths / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Matroids of gain graphs in applied discrete geometry
+Normal rank
@@ Property / cites work @@
+Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
+Normal rank
@@ Property / cites work @@
+Biased graphs. II: The three matroids
@@ Property / cites work: Biased graphs. II: The three matroids / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:317424

Packing non-zero \(A\)-paths via matroid matching (Q317424): Difference between revisions

Latest revision as of 15:06, 12 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)