Transversal Matroids
Transversal Matroid is a matroid defined on the vertex set of a bipartite graph wherein the independent sets are precisely the partial transversals of one part of the vertex partition, distinguished by their representation through matchings in the graph.
39
Publications
1.8K
Citations
64
Authors
47
Institutions
Publications per year
2017–2026
1
Parents
39
1–5 of 39
64
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 64
47

University of Waterloo
Waterloo, Canada
4 h-index
5 publications
163 citations
University of Wisconsin–Madison
Madison, United States
3 h-index
8 publications
268 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
258 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
258 citations

Kingston College
London, United Kingdom
2 h-index
2 publications
56 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
207 citations
The University of Tokyo
Tokyo, Japan
2 h-index
2 publications
63 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
3 publications
70 citations
1–8 of 47
3 publications · 117 citations
3
h-index
3 publications · 118 citations
3
h-index
2 publications · 46 citations
2
h-index
2 publications · 54 citations
2
h-index
2 publications · 37 citations
2
h-index
1–5