Results 111 to 120 of about 1,562 (161)
Cucurbiturils in Oxygen Delivery and Their Potential in Anemia Management. [PDF]
J Clin MedPapiu D +7 more
europepmc +1 more source
Evaluation of owners' and veterinarians' attitudes toward veterinarian dressing styles in a teaching hospital in Taiwan. [PDF]
Sci RepTzu-Yun Teng K, Shiu YJ, Wang SL.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Annals of Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William Y C Chen, Chen William Y C
exaly +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William Y C Chen, Chen William Y C
exaly +2 more sources
Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Belardo +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Belardo +3 more
openaire +2 more sources
Journal of Algorithms, 1992
Summary: A \(k\)-color, \(n\)-bead necklace in an equivalence class of \(k\)-ary \(n\)- tuples under rotation. In this paper, we analyze an algorithm due to Fredricksen, Kessler, and Maiorana (FKM) to show that necklaces can be generated in constant amortized time.
Frank Ruskey +2 more
openaire +2 more sources
Summary: A \(k\)-color, \(n\)-bead necklace in an equivalence class of \(k\)-ary \(n\)- tuples under rotation. In this paper, we analyze an algorithm due to Fredricksen, Kessler, and Maiorana (FKM) to show that necklaces can be generated in constant amortized time.
Frank Ruskey +2 more
openaire +2 more sources
ENUMERATING NECKLACES WITH TRANSITIONS
Bulletin of the Australian Mathematical Society, 2021AbstractNecklaces are the equivalence classes of words under the action of the cyclic group. Let a transition in a word be any change between two adjacent letters modulo the word’s length. We present a closed-form solution for the enumeration of necklaces innbeads,kcolours andttransitions. We show that our result provides a more general solution to the
FRANCESCO BIANCONI, EMANUELE BRUGNOLI
openaire +3 more sources
Discrete Splittings of the Necklace
Mathematics of Operations Research, 2008This paper deals with direct proofs and combinatorial proofs of the famous necklace theorem of Alon, Goldberg, and West. The new results are a direct proof for the case of two thieves and three types of beads, and an efficient constructive proof for the general case with two thieves.
openaire +2 more sources