Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. In this paper, a technique is presented that allows to represent the tree structure of a...

An object is Fractal when it has the property that the structure of its constituent parts reflect the structure of the whole and at various scales. The classic example would be a tree, where a branch of the tree held upright is as the whole tree, and even a leaf of a tree has in its veins a tree like branching structure. Thus a Fractal object is said to be self similar. Another property of Frac...

This article presents a method for finding the critical probability pc for the Bernoulli bond percolation on graphs with the so called tree-like structure. Such graphs can be decomposed into a tree of pieces which have finitely many isomorphism classes. This class of graphs includes the Cayley graphs of amalgamated products, HNN extensions or general groups acting on trees. It also includes all...

Let G1 and G2 be simple graphs and let n1 = |V (G1)|, m1 = |E(G1)|, n2 = |V (G2)| and m2 = |E(G2)|. In this paper we derive sharp upper and lower bounds for the number of spanning trees τ in the Cartesian product G1 G2 of G1 and G2. We show that: τ(G1 G2) ≥ 2(n1−1)(n2−1) n1n2 (τ(G1)n1) n2+1 2 (τ(G2)n2) n1+1 2 and τ(G1 G2) ≤ τ(G1)τ(G2) [ 2m1 n1 − 1 + 2m2 n2 − 1 ](n1−1)(n2−1) . We also characteri...

Elements for a File Structure Description At rst, the concept should be able to describe a static view of a required le structure. Therefore, the concept includes de nitions of terms or elements, which can represent le structure elements. Basic elements of a le structure are les and directories. A directory is a container, which includes a number of les and subdirectories. A directory has attri...