[HTML][HTML] Linear representation of transversal matroids and gammoids parameterized by rank
Given a bipartite graph G=(U⊎ V, E), a linear representation of the transversal matroid
associated with G on the ground set U, can be constructed in randomized polynomial time …
associated with G on the ground set U, can be constructed in randomized polynomial time …
Manipulation strategies for the rank-maximal matching problem
We consider manipulation strategies for the rank-maximal matching problem. Let G=(A ∪ P,
E) be a bipartite graph such that A denotes a set of applicants and P a set of posts. Each …
E) be a bipartite graph such that A denotes a set of applicants and P a set of posts. Each …