Subgraph Counting
Subgraph Counting is a computational method in graph theory that systematically enumerates occurrences of a specified subgraph pattern within a larger graph by leveraging the Inclusion-Exclusion Principle to avoid overcounting overlapping instances.
367
Publications
17.5K
Citations
708
Authors
357
Institutions
Publications per year
2017–2026
97
367
Improved methods for supergraphs
M.T. Grisaru, Warren Siegel, M. Roček · Nuclear Physics B · 1979 · 920 citations
Uriel Feige, David Peleg, Guy Kortsarz · Algorithmica · 2001 · 602 citations
Finding a Maximum Density Subgraph
Andrew V. Goldberg · UC Berkeley · 1984 · 370 citations
1–5 of 367
708
11
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 708
357

Hungarian Academy of Sciences
Budapest, Hungary
11 h-index
23 publications
943 citations
Stanford University
Stanford, United States
10 h-index
14 publications
424 citations
University of California, Santa Cruz
Santa Cruz, United States
10 h-index
15 publications
559 citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
16 publications
592 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
9 publications
616 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
7 h-index
12 publications
901 citations

University of Waterloo
Waterloo, Canada
7 h-index
8 publications
361 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
7 h-index
17 publications
515 citations
1–8 of 357
25 publications · 584 citations
17
h-index
17 publications · 1K citations
12
h-index
Repository · 14 publications · 293 citations
12
h-index
10 publications · 321 citations
10
h-index
10 publications · 352 citations
10
h-index
1–5