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

Authors

708

  1. CS
    C. Seshadhri

    Sandia National Laboratories California, United States

    12 publications · 427 citations

    11

    h-index

  2. RA
    Ryan A. Rossi

    Adobe Systems (United States), United States

    6 publications · 427 citations

    6

    h-index

  3. NW
    Nicholas Wormald

    The University of Melbourne, Australia

    5 publications · 501 citations

    5

    h-index

  4. NK
    Nesreen K. Ahmed

    Intel (United States), United States

    5 publications · 412 citations

    5

    h-index

  5. WZ
    Wenjie Zhang

    UNSW Sydney, Australia

    5 publications · 160 citations

    5

    h-index

1–5 of 708

Venues

  1. Discrete Mathematics

    25 publications · 584 citations

    17

    h-index

  2. Journal of Combinatorial Theory Series B

    17 publications · 1K citations

    12

    h-index

  3. arXiv (Cornell University)

    Repository · 14 publications · 293 citations

    12

    h-index

  4. Theoretical Computer Science

    10 publications · 321 citations

    10

    h-index

  5. Information Processing Letters

    10 publications · 352 citations

    10

    h-index

1–5