Sciweavers

288 search results - page 1 / 58
» Linearly bounded infinite graphs
Sort
View
ACTA
2006
74views more  ACTA 2006»
13 years 5 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 3 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
JSYML
2010
95views more  JSYML 2010»
12 years 12 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
CCCG
2008
13 years 6 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...