# Bingbing Zhuang

• Citations Per Year
• CIAC
• 2010
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 rooted graph to have several different representations, called embeddings. We give a general framework to design algorithms for enumerating embeddings of all graphs in H without(More)
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers n and g, let G2(n, g) denote the set of all biconnected rooted plane graphs with exactly n vertices such that the size of each inner face is at most g. In this paper, we give an(More)
Given a number n of vertices, a lower bound d on the diameter, and a capacity function ∆(k) ≥ 2, k = 0, 1, . . . , ⌊n/2⌋, we consider the problem of enumerating all unrooted trees T with exactly n vertices and a diameter at least d such that the degree of each vertex with distance k from the center of T is at most ∆(k). We give an algorithm that generates(More)
• COCOA
• 2010
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers n ≥ 1 and g ≥ 3, let G3(n, g) denote the set of all triconnected rooted plane graphs with exactly n vertices such that the size of each inner face is at most g. In this paper, we(More)
• IEICE Transactions
• 2011
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that enumerates(More)
• ICIMCS
• 2015
Person re-identification refers to recognizing a person in different locations over non-overlapping cameras. This is an important but very challenging problem in intelligent surveillance video analysis areas. In this paper, we proposed a simple yet efficient framework KISSPOP to design a person re-identification system. In this system, we creatively combine(More)