Results 291 to 300 of about 154,862 (311)
Some of the next articles are maybe not open access.
Generalized Hamiltonian Paths in Tournaments
1984Publisher Summary A tournament is an orientation of a complete graph. Any two vertices (players) v, w are adjacent by exactly one arc, either v → w (v beats w) or w → v. Every tournament Tn has a Hamiltonian path—that is, every tournament Tn realizes the sequences 1, . . . , 1 and 0,. . . , 0.
openaire +2 more sources
Hamiltonian-Driven Adaptive Dynamic Programming With Approximation Errors
IEEE Transactions on Cybernetics, 2022Chengzhong Xu+2 more
exaly
Bayesian Elastic Full‐Waveform Inversion Using Hamiltonian Monte Carlo
Journal of Geophysical Research: Solid Earth, 2020Lars Gebraad+2 more
exaly
Twisted bilayer graphene. III. Interacting Hamiltonian and exact symmetries
Physical Review B, 2021B Andrei Bernevig+2 more
exaly
Hamiltonian theory of guiding-center motion
Reviews of Modern Physics, 2009J R Cary, Alain J Brizard
exaly
Zeitschrift Fur Naturforschung - Section A Journal of Physical Sciences, 2018
R Naz, Imran Naeem
exaly
R Naz, Imran Naeem
exaly
Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph
Journal of Combinatorial Designs, 2013Francesca Merola, Marco Buratti
exaly
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
Networks, 2006Toru Araki
exaly