Efficient theoretic and practical algorithms for linear matroid intersection problems
From MaRDI portal
Publication:1816747
DOI10.1006/jcss.1996.0054zbMath0859.68041MaRDI QIDQ1816747
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
68W10: Parallel algorithms in computer science
Related Items
Making Bipartite Graphs DM-Irreducible, On the Kronecker Canonical Form of Singular Mixed Matrix Pencils, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, On feedback vertex set: new measure and new structures, Evolutionary algorithms and matroid optimization problems, Solving degenerate sparse polynomial systems faster, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, On a weighted linear matroid intersection algorithm by deg-det computation, Exact and approximation algorithms for weighted matroid intersection