Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/693

Title: Expressiveness and complexity of generic graph machines
Authors: Gemis, Marc
Paredaens, Jan
Peelman, Peter
Issue Date: 1998
Publisher: Springer-Verlag
Citation: Theory of Computing Systems, 31(3). p. 231-249
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 betweenGGMcomplexity 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.
URI: http://hdl.handle.net/1942/693
DOI: 10.1007/s002240000087
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A156.58 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.