3211 search results - page 434 / 643 » On the Grundy Number of a Graph |
163
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
154
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
169
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
182
click to vote
OTM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
149
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...