4103 search results - page 112 / 821 » Some results on the Collatz problem |
145
click to vote
DM
2002
15 years 6 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
139
click to vote
RSA
1998
15 years 6 months ago
1998
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
142
click to vote
MICS
2007
15 years 6 months ago
2007
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
132
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We consider a navigation problem for a robot equipped with only a map, compass, and contact sensor. In addition to the limitations placed on sensing, we assume that there exist...
176
click to vote
TCBB
2010
15 years 4 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...