Binary Matroids
Binary Matroids is a matroid that can be represented over the finite field GF(2), distinguished by the property that its structure is entirely determined by a matrix with entries in the two-element field.
230
Publications
9.1K
Citations
253
Authors
194
Institutions
Publications per year
2017–2026
11
Parents
230
Matroids and the greedy algorithm
Jack Edmonds · Mathematical Programming · 1971 · 878 citations
Matroid matching and some applications
László Lovász · Journal of Combinatorial Theory Series B · 1980 · 178 citations
1–5 of 230
253
15
h-index
15
h-index
10
h-index
9
h-index
8
h-index
1–5 of 253
194

University of Waterloo
Waterloo, Canada
18 h-index
27 publications
2.6K citations

Victoria University of Wellington
Wellington, New Zealand
18 h-index
32 publications
1.2K citations
Louisiana State University
Baton Rouge, United States
13 h-index
29 publications
762 citations
The University of Texas at Dallas
Richardson, United States
10 h-index
10 publications
362 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
7 h-index
11 publications
377 citations
The Ohio State University
Columbus, United States
7 h-index
8 publications
219 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
6 h-index
7 publications
442 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
5 publications
158 citations
1–8 of 194
55 publications · 2.3K citations
26
h-index
20 publications · 517 citations
16
h-index
16 publications · 469 citations
13
h-index
11 publications · 314 citations
11
h-index
10 publications · 293 citations
10
h-index
1–5