Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Abstract. The increasing awareness of the benefits of ontologies for information processing has lead to the creation of a number of large ontologies about real world domains. The ...
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Background: Bio-ontologies are key elements of knowledge management in bioinformatics. Rich and rigorous bio-ontologies should represent biological knowledge with high fidelity an...