1566 search results - page 7 / 314 » Contification Using Dominators |
ARSCOM
2007
13 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
DM
2008
13 years 7 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
ICEC
1994
13 years 8 months ago
1994
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
ACL
2000
13 years 8 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...