This paper presents a novel approach for mapping an existing object-oriented database into XML and vice versa. The major motivation to carry out this study is the fact that it is necessary to facilitate platform independent exchange of the content of object oriented databases and the need to store XML in a structured database. There are more common features between the object-oriented model and...

We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. This improves an algorithm proposed by Babson, Finschi and Fukuda. Moreover we strengthen a result of Montellano-Ballesteros and Strausz about crabbed ...

While developing a software system, the complexity in describing a problem should be reduced. This can be done by separating the concern in a clean and explicit way. Each of the concern can be addressed by partitioning a software system into modules. Concerns are clearly identifiable with a special linguistic construct called Aspects, which has been introduced by a new programming paradigm know...

A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-tracea...

A homomorphism from an oriented graph G to an oriented graph H is a mapping φ from the set of vertices of G to the set of vertices of H such that −−−−−−→ φ(u)φ(v) is an arc in H whenever −→ uv is an arc in G. The oriented chromatic index of an oriented graph G is the minimum number of vertices in an oriented graph H such that there exists a homomorphism from the line digraph LD(G) of G to H (th...