3211 search results - page 507 / 643 » On the Grundy Number of a Graph |
COLT
1989
Springer
14 years 1 months ago
1989
Springer
The present paper considers the effects of introducing inaccuracies in a learner’s environment in Gold’s learning model of identification in the limit. Three kinds of inaccu...
GECCO
2006
Springer
14 years 26 days ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
INFOCOM
2000
IEEE
14 years 24 days ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
DCOSS
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...