1605 search results - page 44 / 321 » On Partitional Labelings of Graphs |
117
Voted
COMBINATORICA
2007
15 years 2 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
110
Voted
BSN
2009
IEEE
15 years 7 months ago
2009
IEEE
— Activity monitoring is an important part of pervasive sensing, particularly for assessing activities of daily living for elderly patients and those with chronic diseases. Previ...
159
Voted
PARA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
134
Voted
CCCG
2010
15 years 4 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
107
click to vote
COR
2008
15 years 2 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...