Concepedia

Enumeration Algorithms For Graphs

Enumeration Algorithms for Graphs is a computational method in graph theory that systematically generates each element of a specified set of graph-theoretic structures, such as vertices, edges, subgraphs, or solutions to combinatorial problems, exactly once and without repetition, distinguishing it from algorithms that merely count or decide the existence of such structures.

350

Publications

18K

Citations

648

Authors

346

Institutions

Publications per year

2017–2026

72

Parents

Publications

350

An Algorithm for Subgraph Isomorphism

J. R. Ullmann · Journal of the ACM · 1976 · 2.3K citations · Full text

, , +14

Reverse search for enumeration

David Avis, Komei Fukuda · Discrete Applied Mathematics · 1996 · 760 citations

, , +9

Quantum field theory techniques in graphical enumeration

D. Bessis, C. Itzykson, J.B. Zuber · Advances in Applied Mathematics · 1980 · 600 citations

, , +11

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

Nadav Kashtan, Shalev Itzkovitz, Ron Milo et al. · Bioinformatics · 2004 · 548 citations · Full text

, , +15

Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan · SIAM Journal on Computing · 1980 · 279 citations · Full text

, , +13

1–5 of 350

Authors

648

  1. LQ
    Lu Qin

    University of Technology Sydney, Australia

    9 publications · 320 citations

    9

    h-index

  2. XL
    Xuemin Lin

    UNSW Sydney, Australia

    8 publications · 255 citations

    8

    h-index

  3. WZ
    Wenjie Zhang

    UNSW Sydney, Australia

    8 publications · 258 citations

    8

    h-index

  4. JX
    Jeffrey Xu Yu

    Chinese University of Hong Kong, Hong Kong SAR China

    8 publications · 461 citations

    8

    h-index

  5. NW
    Nicholas Wormald

    The University of Melbourne, Australia

    8 publications · 596 citations

    8

    h-index

1–5 of 648

Institutions

346

  1. UNSW Sydney

    Sydney, Australia

    11 h-index

    22 publications

    787 citations

  2. Chinese University of Hong Kong

    Hong Kong, Hong Kong

    9 h-index

    17 publications

    1.3K citations

  3. University of Technology Sydney

    Sydney, Australia

    8 h-index

    12 publications

    381 citations

  4. Iowa State University

    Ames, United States

    7 h-index

    15 publications

    488 citations

  5. University of Michigan

    Ann Arbor, United States

    6 h-index

    11 publications

    168 citations

  6. Beijing Institute of Technology

    Beijing, China

    6 h-index

    21 publications

    454 citations

  7. University of Waterloo

    Waterloo, Canada

    6 h-index

    6 publications

    135 citations

  8. Nanyang Technological University

    Singapore, Singapore

    6 h-index

    10 publications

    900 citations

1–8 of 346

Venues

  1. Journal of Graph Theory

    13 publications · 509 citations

    12

    h-index

  2. Theoretical Computer Science

    11 publications · 531 citations

    11

    h-index

  3. Algorithmica

    10 publications · 439 citations

    10

    h-index

  4. The Electronic Journal of Combinatorics

    9 publications · 279 citations

    9

    h-index

  5. Discrete Applied Mathematics

    9 publications · 1.2K citations

    9

    h-index

1–5