On the time-space complexity of reachability queries for preprocessed graphs

Lisa Hellerstein, Philip Klein, Robert Wilber

    Research output: Contribution to journalArticle

    Abstract

    How much can preprocessing help in solving graph problems? In this paper, we consider the problem of reachability in a directed bipartite graph, and propose a model for evaluating the usefulness of preprocessing in solving this problem. We give tight bounds for restricted versions of the model that suggest that preprocessing is of limited utility.

    Original languageEnglish (US)
    Pages (from-to)261-267
    Number of pages7
    JournalInformation Processing Letters
    Volume35
    Issue number5
    DOIs
    StatePublished - Aug 28 1990

      Fingerprint

    Keywords

    • Computational complexity
    • graph reachability
    • preprocessing
    • time-space trade-offs

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Signal Processing
    • Information Systems
    • Computer Science Applications

    Cite this