44 search results - page 1 / 9 » Fractional Kernels in Digraphs |
JCT
1998
13 years 4 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
ENDM
2007
13 years 4 months ago
2007
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
TIP
2011
12 years 11 months ago
2011
—This paper introduces kernel versions of maximum autocorrelation factor (MAF) analysis and minimum noise fraction (MNF) analysis. The kernel versions are based upon a dual formu...
DISOPT
2011
12 years 11 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...