Concepedia

Independent Set Algorithms

Independent Set Algorithms is a class of algorithms in graph theory that identify a subset of vertices in a graph such that no two vertices in the subset are adjacent, distinguishing it from other graph partitioning or selection methods by enforcing mutual non-adjacency as the defining constraint.

611

Publications

33.3K

Citations

1.1K

Authors

514

Institutions

Publications per year

2017–2026

114

Parents

Publications

611

Probabilistic checking of proofs

Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text

, , +14

A Simple Parallel Algorithm for the Maximal Independent Set Problem

Michael Luby · SIAM Journal on Computing · 1986 · 1.1K citations

, , +12

A fast and simple randomized parallel algorithm for the maximal independent set problem

Noga Alon, László Babai, Alon Itai · Journal of Algorithms · 1986 · 842 citations

, , +13

On generating all maximal independent sets

David S. Johnson, Mihalis Yannakakis, Christos H. Papadimitriou · Information Processing Letters · 1988 · 768 citations

, , +5

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

1–5 of 611

Authors

1.1K

  1. VL
    Vadim Lozin

    University of Warwick, United Kingdom

    11 publications · 333 citations

    10

    h-index

  2. MM
    Magnús M. Halldórsson

    Reykjavík University, Iceland

    12 publications · 839 citations

    10

    h-index

  3. VT
    Vangélis Th. Paschos

    Université Paris Dauphine-PSL, France

    7 publications · 235 citations

    7

    h-index

  4. MM
    Martin Milanič

    University of Primorska, Slovenia

    7 publications · 346 citations

    7

    h-index

  5. GJ
    Gerard J. Chang

    National Yang Ming Chiao Tung University, Taiwan

    6 publications · 146 citations

    6

    h-index

1–5 of 1.1K

Institutions

514

  1. Massachusetts Institute of Technology

    Cambridge, United States

    17 h-index

    35 publications

    2.8K citations

  2. Carnegie Mellon University

    Pittsburgh, United States

    15 h-index

    25 publications

    1.5K citations

  3. University of California, Berkeley

    Berkeley, United States

    15 h-index

    19 publications

    2.7K citations

  4. ETH Zurich

    Zurich, Switzerland

    12 h-index

    25 publications

    1.1K citations

  5. University of Warwick

    Coventry, United Kingdom

    11 h-index

    16 publications

    458 citations

  6. University of Waterloo

    Waterloo, Canada

    11 h-index

    17 publications

    753 citations

  7. Princeton University

    Princeton, United States

    11 h-index

    13 publications

    2.4K citations

  8. Tel Aviv University

    Tel Aviv, Israel

    11 h-index

    15 publications

    2.3K citations

1–8 of 514

Venues

  1. Discrete Applied Mathematics

    34 publications · 1.5K citations

    22

    h-index

  2. SIAM Journal on Computing

    18 publications · 3.8K citations

    17

    h-index

  3. Information Processing Letters

    19 publications · 1.3K citations

    17

    h-index

  4. Discrete Mathematics

    26 publications · 1K citations

    16

    h-index

  5. SIAM Journal on Discrete Mathematics

    17 publications · 631 citations

    14

    h-index

1–5