Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity
DOI10.1137/1.9781611973402.42zbMath1423.05038OpenAlexW4253929783MaRDI QIDQ5384002
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.42
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Projective representations and multipliers (20C25)
Related Items (1)
This page was built for publication: Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity
