DAM
2011
13 years 6 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
DAM
2011
13 years 6 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
DAM
2011
13 years 6 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
DAM
2011
13 years 6 months ago
2011
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
DAM
2011
13 years 6 months ago
2011
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic ...
DAM
2011
13 years 6 months ago
2011
DAM
2011
13 years 6 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
CVIU
2011
13 years 6 months ago
2011
CVIU
2011
13 years 6 months ago
2011
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
CVIU
2011
13 years 6 months ago
2011