Parallel algorithms for matroid intersection and matroid parity

DOI10.1142/S1793830915500196zbMATH Open1319.05032MaRDI QIDQ5261053FDOQ5261053

Jinyu Huang

Publication date: 1 July 2015

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

zbMATH Keywords

matroid intersectionmatroid parityparallel alorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• A Fast, Simpler Algorithm for the Matroid Parity Problem
• Title not available (Why is that?)

   Recommendations

• Linear matroid intersection is in quasi-NC 👍 👎
• Title not available (Why is that?) 👍 👎
• Linear matroid intersection is in quasi-NC 👍 👎
• Title not available (Why is that?) 👍 👎
• A parameterized view on matroid optimization problems 👍 👎
• Two algorithms for weighted matroid intersection 👍 👎
• A Parameterized View on Matroid Optimization Problems 👍 👎
• Generalized matroid matching 👍 👎
• Algebraic algorithms for linear matroid parity problems 👍 👎
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems 👍 👎

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

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