Matchings Enumeration is the systematic count of all possible matchings—subsets of edges in a graph without shared vertices—within a given graph structure, distinguished by its focus on exact combinatorial enumeration rather than existence or optimization.
110
Publications
6.6K
Citations
202
Authors
140
Institutions
Publications per year
2017–2026
14
Parents
Publications
110
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
The Complexity of Counting in Sparse, Regular, and Planar Graphs
Salil Vadhan · SIAM Journal on Computing · 2001 · 260 citations · Full text
The Complexity of Counting Stable Marriages
Robert W. Irving, P.S.H. Leather · SIAM Journal on Computing · 1986 · 224 citations
1–5 of 110
Authors
202
- IM
3
h-index
- TD
3
h-index
- FZ
3
h-index
- WY
3
h-index
- FL
2
h-index
1–5 of 202
Institutions
140
Nankai University
Tianjin, China
7 h-index
14 publications
386 citations
Centre National de la Recherche Scientifique
Paris, France
6 h-index
9 publications
416 citations
Xiamen University
Xiamen, China
5 h-index
10 publications
219 citations
Princeton University
Princeton, United States
4 h-index
4 publications
2.4K citations
University of Zagreb
Zagreb, Croatia
3 h-index
3 publications
49 citations
Université Paris-Sud
Orsay, France
3 h-index
7 publications
462 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
8 publications
340 citations
Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
114 citations
1–8 of 140
Venues
- The Electronic Journal of Combinatorics
12 publications · 337 citations
11
h-index
- Discrete Mathematics
10 publications · 328 citations
10
h-index
- Journal of Combinatorial Theory Series A
7 publications · 296 citations
7
h-index
- Discrete Applied Mathematics
5 publications · 135 citations
5
h-index
- Theoretical Computer Science
4 publications · 227 citations
4
h-index
1–5