Abstract. Recent work has shown that many cellular automata (CA) have configurations whose orbit closures are isomorphic to odometers. We investigate the geometry of the spacetime ...
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
The h-h/2-strategy is one very basic and well-known technique for the a posteriori error estimation for Galerkin discretizations of energy minimization problems. Let denote the e...
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
Bostjan Bresar, Sandi Klavzar, Aleksandra Tepeh Ho...