On Shank's algorithm for modular square roots.
Page 1
Displaying 1 – 11 of 11
On the behaviour of learning algorithms in a changing environment with application to data network routing problem
Athanasios V. Vasilakos (1990)
Kybernetika
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
R. Seidel, J. Ruppert (1992)
Discrete & computational geometry
On the distributed decision-making complexity of the minimum vertex cover problem
Pierluigi Crescenzi, Luca Trevisan (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
On the parallel complexity of the alternating Hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (2010)
RAIRO - Operations Research
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges differ in color. The problem of finding such a cycle, even for 2-edge-colored graphs, is trivially NP-complete, while it is known to be polynomial for 2-edge-colored complete graphs. In this paper we study the parallel complexity of finding such a cycle, if any, in 2-edge-colored complete graphs. We give a new characterization for such a graph admitting an alternating Hamiltonian cycle which allows...
On the proper intervalization of colored caterpillar trees
Carme Àlvarez, Maria Serna (2009)
RAIRO - Theoretical Informatics and Applications
This paper studies the computational complexity of the proper interval colored graph problem (PICG), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the PICG and a graph layout problem the proper colored layout problem (PCLP). We show a dichotomy: the PICG and the PCLP are NP-complete for colored caterpillars of hair length ≥2, while both problems are in P for colored caterpillars of hair length <2. For...
On-line computations of the ideal lattice of posets
Claude Jard, Guy-Vincent Jourdan, Jean-Xavier Rampon (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On-line evaluation of powers using Euclid's algorithm
Srećko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On-line -adic covering by the method of the -th segment and its application to on-line covering by cubes.
Januszewski, Janusz, Lassak, Marek, Rote, Günter, Woeginger, Gerhard (1996)
Beiträge zur Algebra und Geometrie
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Currently displaying 1 – 11 of 11
Page 1