721 search results - page 118 / 145 » Bounds on the k-domination number of a graph |
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IPCCC
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
131
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
100
click to vote
LION
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
109
click to vote
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...