Skip to main content
SpringerLink
Log in

Expressiveness and Complexity of Generic Graph Machines

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

The Generic Graph Machine (GGM) model is a Turing machine-like model for expressing generic computations working directly on graph structures. In this paper we present a number of observations concerning the expressiveness and complexity of GGMs. Our results comprise the following: (i) an intrinsic characterization of the pairs of graphs that are an input—output pair of some GGM; (ii) a comparison between GGM complexity and TM complexity; and (iii) a detailed discussion on the connections between the GGM model and other generic computation models considered in the literature, in particular the generic complexity classes of Abiteboul and Vianu, and the Database Method Schemes of Denninghoff and Vianu.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Antwerp (UIA), Informatica, Universiteitsplein 1, B-2610 Antwerp, Belgium pareda@uia.ua.ac.be, , , , , , BE

    M. Gemis, J. Paredaens, P. Peelman & J. Van den Bussche

Authors
  1. M. Gemis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Paredaens
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Peelman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 1995, and in final form August 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gemis, M., Paredaens, J., Peelman, P. et al. Expressiveness and Complexity of Generic Graph Machines . Theory Comput. Systems 31, 231–249 (1998). https://doi.org/10.1007/s002240000087

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000087

Keywords

Search

Navigation