Welcome to Anagrammer Crossword Genius! Keep reading below to see if capacitate is an answer to any crossword puzzle or word game (Scrabble, Words With Friends etc). Scroll down to see all the info we have compiled on capacitate.
capacitate
Searching in Crosswords ...
The answer CAPACITATE has 2 possible clue(s) in existing crosswords.
Searching in Word Games ...
The word CAPACITATE is VALID in some board games. Check CAPACITATE in word games in Scrabble, Words With Friends, see scores, anagrams etc.
Searching in Dictionaries ...
Definitions of capacitate in various dictionaries:
verb - make legally capable or qualify in law
verb - cause (spermatozoa) to undergo the physical changes necessary to fertilize an egg
verb - make capable
Word Research / Anagrams and more ...
Keep reading for additional results and analysis below.
Possible Crossword Clues |
---|
Enable |
Make legally competent |
Last Seen in these Crosswords & Puzzles |
---|
Oct 6 2012 The Times - Concise |
Aug 5 2006 Newsday.com |
Possible Dictionary Clues |
---|
Make (someone) capable of a particular action or legally competent to act in a particular way. |
make (someone) capable of a particular action or legally competent to act in a particular way. |
To render fit or make qualified enable. |
Biology To cause (spermatozoa) to undergo the physical changes needed to penetrate and fertilize an egg. |
make capable |
cause (spermatozoa) to undergo the physical changes necessary to fertilize an egg |
make legally capable or qualify in law |
Capacitate might refer to |
---|
Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node * * * * r * * * {\displaystyle r} * and satisfies the capacity constraint * * * * c * * * {\displaystyle c} * . The capacity constraint ensures that all subtrees (maximal subgraphs connected to the root by a single edge) incident on the root node * * * * r * * * {\displaystyle r} * have no more than * * * * c * * * {\displaystyle c} * nodes. If the tree nodes have weights, then the capacity constraint may be interpreted as follows: the sum of weights in any subtree should be no greater than * * * * c * * * {\displaystyle c} * . The edges connecting the subgraphs to the root node are called gates. Finding the optimal solution is NP-hard. |