1605 search results - page 131 / 321 » On Partitional Labelings of Graphs |
WG
2007
Springer
14 years 4 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
ICALP
2011
Springer
13 years 2 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
CVPR
2005
IEEE
15 years 23 days ago
2005
IEEE
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
DAM
2008
13 years 10 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
JCO
2007
13 years 10 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...