36781 search results - page 130 / 7357 » Parameterizing by the Number of Numbers |
ASE
2010
13 years 10 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
DM
2008
13 years 10 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
COMBINATORICS
2006
13 years 10 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
DAM
2006
13 years 10 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...