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

    Reachability
    Preprocessing
    Space-time
    Query
    Directed graphs
    Graph in graph theory
    Bipartite Graph
    Directed Graph
    Model

    Keywords

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

    ASJC Scopus subject areas

    • Computational Theory and Mathematics

    Cite this

    On the time-space complexity of reachability queries for preprocessed graphs. / Hellerstein, Lisa; Klein, Philip; Wilber, Robert.

    In: Information Processing Letters, Vol. 35, No. 5, 28.08.1990, p. 261-267.

    Research output: Contribution to journalArticle

    Hellerstein, Lisa ; Klein, Philip ; Wilber, Robert. / On the time-space complexity of reachability queries for preprocessed graphs. In: Information Processing Letters. 1990 ; Vol. 35, No. 5. pp. 261-267.
    @article{6709686e33a94a95bf072ba918e0a704,
    title = "On the time-space complexity of reachability queries for preprocessed graphs",
    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.",
    keywords = "Computational complexity, graph reachability, preprocessing, time-space trade-offs",
    author = "Lisa Hellerstein and Philip Klein and Robert Wilber",
    year = "1990",
    month = "8",
    day = "28",
    doi = "10.1016/0020-0190(90)90055-3",
    language = "English (US)",
    volume = "35",
    pages = "261--267",
    journal = "Information Processing Letters",
    issn = "0020-0190",
    publisher = "Elsevier",
    number = "5",

    }

    TY - JOUR

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

    AU - Hellerstein, Lisa

    AU - Klein, Philip

    AU - Wilber, Robert

    PY - 1990/8/28

    Y1 - 1990/8/28

    N2 - 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.

    AB - 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.

    KW - Computational complexity

    KW - graph reachability

    KW - preprocessing

    KW - time-space trade-offs

    UR - http://www.scopus.com/inward/record.url?scp=0025476023&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0025476023&partnerID=8YFLogxK

    U2 - 10.1016/0020-0190(90)90055-3

    DO - 10.1016/0020-0190(90)90055-3

    M3 - Article

    VL - 35

    SP - 261

    EP - 267

    JO - Information Processing Letters

    JF - Information Processing Letters

    SN - 0020-0190

    IS - 5

    ER -