Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity

DOI10.4230/LIPIcs.ISAAC.2016.63zbMath1398.05207OpenAlexW2572148344MaRDI QIDQ4636549

Yutaro Yamaguchi

Publication date: 19 April 2018

Full work available at URL: https://doi.org/10.4230/lipics.isaac.2016.63

zbMATH Keywords

tractabilitygroup-labeled graphslinear matroid parityweighted problemsMader's \(\mathcal{S}\)-pathspacking non-zero \(A\)-paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A Weighted Linear Matroid Parity Algorithm ⋮ Shortest \((A+B)\)-path packing via hafnian ⋮ Pfaffian pairs and parities: counting on linear matroid intersection and parity problems ⋮ Unnamed Item ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems

This page was built for publication: Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity