4171 search results - page 578 / 835 » Choice numbers of graphs |
157
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...
173
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...
184
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...
152
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...
183
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...