Poset matching---a distributive analog of independent matching
From MaRDI portal
(Redirected from Publication:685701)
Recommendations
Cites work
- scientific article; zbMATH DE number 3904604 (Why is no real title available?)
- scientific article; zbMATH DE number 4025456 (Why is no real title available?)
- scientific article; zbMATH DE number 4027489 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3600054 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- A weighted matroid intersection algorithm
- An intersection theorem for supermatroids
- Dependence relations in a semi-modular lattice
- Geometries on partially ordered sets
- Independence Spaces and Combinatorial Problems
- Matching Theory for Combinatorial Geometries
- Matroid Intersection
- Optimal matchings in posets
- Rado's theorem for polymatroids
- The greedy algorithm for partially ordered sets
- Transversals and matroid partition
Cited in
(9)- Optimal matchings in posets
- Antimatroids induced by matchings
- A note on order preserving matchings
- Matroids on convex geometries: subclasses, operations, and optimization
- Matroids on partially ordered sets
- $n!$ matchings, $n!$ posets
- Matroids on convex geometries (cg-matroids)
- Rank functions of strict cg-matroids
- On D-complementation
This page was built for publication: Poset matching---a distributive analog of independent matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685701)