310 search results - page 42 / 62 » dam 2008 |
DAM
2006
13 years 10 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
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 ...
DAM
2006
13 years 10 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
DAM
2006
13 years 10 months ago
2006
Let p be a prime, q = pm and Fq be the finite field with q elements. In this paper, we will consider q-ary sequences of period qn - 1 for q > 2 and study their various balance ...
DAM
2006
13 years 10 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...