In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Abstract We describe the ‘Hierarchical as View’ approach to knowledge integration from heterogeneous sources. This is based on a novel representation called Layered Conceptual ...
Madalina Croitoru, Ernesto Compatangelo, Chris Mel...
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...