scientific article; zbMATH DE number 4068895

MaRDI QIDQ3801569zbMATH OpenFDO

Authors Zhemin Wang

Publication date 1987

zbMATH Keywords

cardinality matroid intersection algorithmmatroids

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
• scientific article; zbMATH DE number 26304
• Efficient algorithms for a family of matroid intersection problems
• scientific article; zbMATH DE number 2086910
• scientific article; zbMATH DE number 3904606
• Valuated Matroid Intersection II: Algorithms
• scientific article; zbMATH DE number 4089608
• Efficient theoretic and practical algorithms for linear matroid intersection problems
• Exact and approximation algorithms for weighted matroid intersection
• Exact and approximation algorithms for weighted matroid intersection

Cited in

(10)

• A new algorithm for the intersection of a line with the independent set polytope of a matroid
• Note on recognition of matroid systems
• scientific article; zbMATH DE number 3841889 (Why is no real title available?)
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Two algorithms for weighted matroid intersection
• scientific article; zbMATH DE number 26304 (Why is no real title available?)
• scientific article; zbMATH DE number 123444 (Why is no real title available?)
• scientific article; zbMATH DE number 1953191 (Why is no real title available?)
• An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator

This page was built for publication:

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