#### Filter Results:

#### Publication Year

2010

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper, we consider an arbitrary class H of rooted graphs such that each bicon-nected 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 ≥ 1 and g ≥ 3, let G 3 (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)

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)

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)

Given a multiset M = V 1 ∪ V 2 ∪ · · · ∪ V C of n elements and a capacity function ∆ : [1, C] → [2, n − 1], we consider the problem of enumerating all unrooted trees T on M such that the degree of each vertex v ∈ V i is bounded from above by ∆(i). The problem has a direct application of enumerating isomers of tree-like chemical graphs. We give an algorithm… (More)

- ‹
- 1
- ›