Matching Problems
Matching Problems is a combinatorial optimization problem in which the objective is to find a subset of edges in a graph such that no two edges share a common vertex, thereby forming a maximum or optimal independent set of pairings under specific constraints.
1.9K
Publications
108.8K
Citations
3K
Authors
1K
Institutions
Publications per year
2017–2026
344
Parents
1.9K
Fast Pattern Matching in Strings
Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
Linear pattern matching algorithms
Peter Weiner · 1973 · 1.8K citations
1–5 of 1.9K
3K
17
h-index
16
h-index
14
h-index
14
h-index
13
h-index
1–5 of 3K
1K
Stanford University
Stanford, United States
32 h-index
80 publications
7.3K citations
Carnegie Mellon University
Pittsburgh, United States
25 h-index
58 publications
6.6K citations
University of California, Berkeley
Berkeley, United States
25 h-index
37 publications
7K citations

Tel Aviv University
Tel Aviv, Israel
23 h-index
57 publications
2.1K citations
University of Michigan
Ann Arbor, United States
22 h-index
37 publications
1.9K citations

University of Glasgow
Glasgow, United Kingdom
22 h-index
41 publications
2K citations
University of Pennsylvania
Philadelphia, United States
21 h-index
57 publications
3.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
44 publications
3.5K citations
1–8 of 1K
TPAMI · 33 publications · 7.1K citations
30
h-index
41 publications · 9.4K citations
30
h-index
71 publications · 2.4K citations
29
h-index
55 publications · 2.4K citations
28
h-index
39 publications · 2.3K citations
23
h-index
1–5