Concepedia

Space Complexity Of Graph Problems

Space Complexity of Graph Problems is a theoretical construct in computational complexity theory that characterizes the minimal amount of memory space required by an algorithm to solve graph-theoretic decision or optimization problems as a function of the input graph's size.

237

Publications

13.1K

Citations

477

Authors

270

Institutions

Publications per year

2017–2026

31

Parents

Publications

237

Computing the Minimum Fill-In is NP-Complete

Mihalis Yannakakis · SIAM Journal on Algebraic and Discrete Methods · 1981 · 709 citations

, , +11

Arboricity and Subgraph Listing Algorithms

Norishige Chiba, Takao Nishizeki · SIAM Journal on Computing · 1985 · 665 citations

, , +14

Space-efficient static trees and graphs

G. Jacobson · 1989 · 649 citations

, , +12

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

Undirected connectivity in log-space

Omer Reingold · Journal of the ACM · 2008 · 511 citations

, , +16

1–5 of 237

Authors

477

  1. IF
    Irene Finocchi

    Sapienza University of Rome, Italy

    5 publications · 163 citations

    5

    h-index

  2. AM
    Andrew McGregor

    University of Massachusetts Amherst, United States

    4 publications · 333 citations

    4

    h-index

  3. DE
    David Eppstein

    University of California, Irvine, United States

    4 publications · 139 citations

    4

    h-index

  4. SD
    Samir Datta

    Loughborough University, United Kingdom

    4 publications · 97 citations

    4

    h-index

  5. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    4 publications · 198 citations

    4

    h-index

1–5 of 477

Institutions

270

  1. Centre National de la Recherche Scientifique

    Paris, France

    9 h-index

    17 publications

    981 citations

  2. Sapienza University of Rome

    Rome, Italy

    8 h-index

    19 publications

    878 citations

  3. University of Bergen

    Bergen, Norway

    7 h-index

    18 publications

    672 citations

  4. Hebrew University of Jerusalem

    Jerusalem, Israel

    6 h-index

    9 publications

    788 citations

  5. RWTH Aachen University

    Aachen, Germany

    6 h-index

    10 publications

    579 citations

  6. Technische Universität Berlin

    Berlin, Germany

    6 h-index

    11 publications

    245 citations

  7. Institute of Mathematical Sciences

    Chennai, India

    5 h-index

    9 publications

    497 citations

  8. Carnegie Mellon University

    Pittsburgh, United States

    5 h-index

    5 publications

    775 citations

1–8 of 270

Venues

  1. SIAM Journal on Computing

    15 publications · 2K citations

    13

    h-index

  2. Algorithmica

    13 publications · 568 citations

    13

    h-index

  3. Discrete Applied Mathematics

    17 publications · 353 citations

    12

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 11 publications · 302 citations

    11

    h-index

  5. arXiv (Cornell University)

    Repository · 11 publications · 183 citations

    10

    h-index

1–5