216 search results - page 41 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
STOC
2010
ACM
13 years 7 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
ISCAS
2006
IEEE
14 years 29 days ago
2006
IEEE
the following cost functions: In this paper, learning rules are proposed for simultaneous corn- GI(U) = tr{(UTU)(UTBU)-lD, (la) putation of minor eigenvectors of a covariance matri...
SIROCCO
2010
13 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...