#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bingbing Zhuang, Hiroshi Nagamochi
- CIAC
- 2010

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 graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces are triangle. In a rooted triangulated planar graph, a vertex and two edges incident to it are designated as an outer vertex and outer edges, respectively. Two plane embedding of rooted triangulated planar graphs are defined to be equivalent… (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 G 2 (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 all… (More)

- Bingbing Zhuang, Hiroshi Nagamochi
- 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 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)

- Bingbing Zhuang, Hiroshi Nagamochi
- TAMC
- 2010

- Bingbing Zhuang, Hiroshi Nagamochi
- FAW
- 2010

- Bingbing Zhuang, Ziping Zhu, Fangbemi Abassin Sourou, Nenghai Yu
- 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)

A biconnected plane graph G is called internally triconnected if any cut-pair consists of outer vertices and its removal results in only components each of which contains at least one outer vertex. In a rooted plane graph, an edge is designated as an outer edge with a specified direction. For given positive integers n ≥ 1 and g ≥ 3, let G 3 (n, g) (resp., G… (More)

- Bingbing Zhuang, Hiroshi Nagamochi
- 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)