1605 search results - page 92 / 321 » On Partitional Labelings of Graphs |
JGT
2006
13 years 9 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
ICMCS
2010
IEEE
13 years 10 months ago
2010
IEEE
Labeling persons appearing in video frames with names detected from the video transcript helps improving the video content identification and search task. We develop a face naming...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...