Previous Page 2
Tomáš Hejda (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.
Tomáš Hejda (2012)
RAIRO - Theoretical Informatics and Applications
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL±(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η.
Biswajit Deb, Kalpesh Kapoor (2014)
Discussiones Mathematicae Graph Theory
Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole. Consider a single player game in which a robot or obstacle can be moved to adjacent vertex if it has a hole. The objective is to take the robot to a fixed destination vertex using minimum number of moves. In general, it is not necessary that the robot will take a shortest path...
Constantine, Gregory (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
C. C. Koung, J. Opatrny (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Bousquet-Mélou, Mireille (1998)
The Electronic Journal of Combinatorics [electronic only]
Previous Page 2