Packing A-paths in group-labelled graphs via linear matroid parity

DOI10.1137/1.9781611973402.42MaRDI QIDQ5384002zbMATH OpenOpenAlexFDO

Authors Yutaro Yamaguchi

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Projective representations and multipliers (20C25)

Recommendations

• Packing \(A\)-paths in group-labelled graphs via linear matroid parity
• Packing non-returning A-paths
• Packing non-zero \(A\)-paths via matroid matching
• Shortest disjoint \(S\)-paths via weighted linear matroid parity
• An algorithm for packing non-zero \(A\)-paths in group-labelled graphs

Cited in

(7)

• Packing \(A\)-paths in group-labelled graphs via linear matroid parity
• Packing non-returning A-paths algorithmically
• Packing non-zero \(A\)-paths via matroid matching
• Shortest disjoint \(S\)-paths via weighted linear matroid parity
• An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Packing non-returning A-paths

This page was built for publication: Packing \(A\)-paths in group-labelled graphs via linear matroid parity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384002)