Concepedia

Randomized Graph Algorithms

Randomized Graph Algorithms is a class of graph algorithms that incorporate randomness into their decision-making processes to achieve improved average-case performance, simplicity, or scalability in solving graph-theoretic problems.

748

Publications

39K

Citations

1.2K

Authors

500

Institutions

Publications per year

2017–2026

127

Parents

Publications

748

Algorithmic graph theory and perfect graphs

M.J. Rijckaert · Journal of Computational and Applied Mathematics · 1980 · 1.2K citations

, , +12

Color-coding

Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM · 1995 · 1K citations · Full text

, , +16

Viceroy

Dahlia Malkhi, Moni Naor, David Ratajczak · 2002 · 639 citations

, , +13

A New Algorithm for Generating All the Maximal Independent Sets

Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi et al. · SIAM Journal on Computing · 1977 · 615 citations

, , +13

Rigidity, computation, and randomization in network localization

Tolga Eren, O.K. Goldenberg, Walter Whiteley et al. · 2005 · 521 citations

, , +15

1–5 of 748

Authors

1.2K

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    27 publications · 1.4K citations

    19

    h-index

  2. NA
    Noga Alon

    Tel Aviv University, Israel

    23 publications · 2.6K citations

    17

    h-index

  3. MG
    Mohsen Ghaffari

    ETH Zurich, Switzerland

    15 publications · 658 citations

    14

    h-index

  4. UF
    Uriel Feige

    Weizmann Institute of Science, Israel

    14 publications · 1.1K citations

    12

    h-index

  5. SP
    Seth Pettie

    University of Michigan, United States

    12 publications · 655 citations

    12

    h-index

1–5 of 1.2K

Institutions

500

  1. Tel Aviv University

    Tel Aviv, Israel

    26 h-index

    86 publications

    7.7K citations

  2. ETH Zurich

    Zurich, Switzerland

    22 h-index

    51 publications

    2.5K citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    21 h-index

    55 publications

    2.1K citations

  4. Stanford University

    Stanford, United States

    20 h-index

    51 publications

    4K citations

  5. Weizmann Institute of Science

    Rehovot, Israel

    20 h-index

    33 publications

    3K citations

  6. Massachusetts Institute of Technology

    Cambridge, United States

    18 h-index

    33 publications

    1.2K citations

  7. Microsoft (United States)

    Redmond, United States

    17 h-index

    30 publications

    1.2K citations

  8. University of California, Berkeley

    Berkeley, United States

    14 h-index

    23 publications

    2.2K citations

1–8 of 500

Venues

  1. Random Structures and Algorithms

    46 publications · 2.9K citations

    27

    h-index

  2. SIAM Journal on Computing

    39 publications · 2.7K citations

    25

    h-index

  3. arXiv (Cornell University)

    Repository · 28 publications · 843 citations

    15

    h-index

  4. Discrete Applied Mathematics

    20 publications · 895 citations

    15

    h-index

  5. COMBINATORICA

    17 publications · 934 citations

    15

    h-index

1–5