Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
The significance of functional programming is revealed as that the feasible approach to language extensibility which it enables is further applicable to programming in general and...
Paul A. Bailes, Colin J. M. Kemp, Ian Peake, Sean ...
Abstract. The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interest...