Efficient theoretic and practical algorithms for linear matroid intersection problems

DOI10.1006/JCSS.1996.0054zbMath0859.68041OpenAlexW2018158936MaRDI QIDQ1816747

Ying Xu, Harold N. Gabow

Publication date: 31 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/59a4cd58bc150a2b1784dcb7a3e87f8ce8944bc0

zbMATH Keywords

matroid intersection problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (10)

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils ⋮ Evolutionary algorithms and matroid optimization problems ⋮ Making Bipartite Graphs DM-Irreducible ⋮ Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation ⋮ On a weighted linear matroid intersection algorithm by deg-det computation ⋮ On feedback vertex set: new measure and new structures ⋮ Solving degenerate sparse polynomial systems faster ⋮ Pfaffian pairs and parities: counting on linear matroid intersection and parity problems ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems

This page was built for publication: Efficient theoretic and practical algorithms for linear matroid intersection problems