Parallel algorithms for matroid intersection and matroid parity

DOI10.1142/S1793830915500196zbMath1319.05032MaRDI QIDQ5261053

Jinyu Huang

Publication date: 1 July 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

matroid paritymatroid intersectionparallel alorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Matroid matching via mixed skew-symmetric matrices
• Division in logspace-uniformNC¹
• Derandomizing polynomial identity tests means proving circuit lower bounds

This page was built for publication: Parallel algorithms for matroid intersection and matroid parity