Let G be a graph and A be a subset of the edges of G. A frame decomposition of G is a pair (G-A,A) such t ha t G-A is connected. A smooth frame decomposition of G is a frame decompo sition satisfying the two conditi...Let G be a graph and A be a subset of the edges of G. A frame decomposition of G is a pair (G-A,A) such t ha t G-A is connected. A smooth frame decomposition of G is a frame decompo sition satisfying the two conditions: (1) Every leaf of G-A has a connected cotree and (2) The set of bridges of G-B(G-A) is A, where B(G-A) is the set of bridges of G-A. An efficient algorithm on finding a smooth frame decompositi on of a graph is provided.展开更多
The linear encoding of a quadtree is an efficient way to represent the quadtree. In this paper, an improved linear quadtree, a cell linear quadtree, is proposed, in which its redundant storage is eliminated and the co...The linear encoding of a quadtree is an efficient way to represent the quadtree. In this paper, an improved linear quadtree, a cell linear quadtree, is proposed, in which its redundant storage is eliminated and the concept of a cell is introduced. Therefore, it has higher storage efficiency than a conventional linear quadtree.展开更多
文摘Let G be a graph and A be a subset of the edges of G. A frame decomposition of G is a pair (G-A,A) such t ha t G-A is connected. A smooth frame decomposition of G is a frame decompo sition satisfying the two conditions: (1) Every leaf of G-A has a connected cotree and (2) The set of bridges of G-B(G-A) is A, where B(G-A) is the set of bridges of G-A. An efficient algorithm on finding a smooth frame decompositi on of a graph is provided.
文摘The linear encoding of a quadtree is an efficient way to represent the quadtree. In this paper, an improved linear quadtree, a cell linear quadtree, is proposed, in which its redundant storage is eliminated and the concept of a cell is introduced. Therefore, it has higher storage efficiency than a conventional linear quadtree.
