Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An Algorithm for Finding a Cycle of Fields in a Matrix”
Interchangeability of relevant cycles in graphs.
Staging in Balas' algorithm
Jaroslav Hrouda (1971)
Aplikace matematiky
Similarity:
Exotic Collatz cycles
John L. Simons (2008)
Acta Arithmetica
Similarity:
On the classification of primitive ideals for complex classical Lie algebras, II
Devra Garfinkle (1992)
Compositio Mathematica
Similarity:
On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Concerning the homological structure of the functional space
Karol Borsuk (1952)
Fundamenta Mathematicae
Similarity:
Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm.
Che, Ada, Chu, Chengbin (2008)
Mathematical Problems in Engineering
Similarity:
Searching for Kaprekar's constants: algorithms and results.
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Polynomial cycles in certain rings of rationals
Władysław Narkiewicz (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
A theorem concerning homologies in a compact space
W. Puckett (1938)
Fundamenta Mathematicae
Similarity: