Packing non-zero \(A\)-paths via matroid matching
From MaRDI portal
Publication:317424
DOI10.1016/j.dam.2016.06.001zbMath1346.05260OpenAlexW2467002039MaRDI QIDQ317424
Shin-ichi Tanigawa, Yutaro Yamaguchi
Publication date: 30 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.001
Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Finding a path with two labels forbidden in group-labeled graphs ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing non-zero \(A\)-paths in group-labelled graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Matching theory
- Matroid matching and some applications
- Biased graphs. II: The three matroids
- Über die Maximalzahl kreuzungsfreier H-Wege
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Packing non-returning A-paths
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
- Matroids of gain graphs in applied discrete geometry
- Complexity of Matroid Property Algorithms
This page was built for publication: Packing non-zero \(A\)-paths via matroid matching