Sciweavers

16 search results - page 3 / 4
» The irreducibility of some level 1 Hecke polynomials
Sort
View
CPM
2009
Springer
137views Combinatorics» more  CPM 2009»
14 years 2 months ago
The Structure of Level-k Phylogenetic Networks
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
Philippe Gambette, Vincent Berry, Christophe Paul
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
FCT
2007
Springer
13 years 9 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
CSR
2008
Springer
13 years 7 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
ECAI
2008
Springer
13 years 9 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague