Sciweavers

193 search results - page 13 / 39
» Duality in Infinite Graphs
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
Harrie Jan Sander Bruggink
FSTTCS
2010
Springer
13 years 5 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
SIAMDM
2008
140views more  SIAMDM 2008»
13 years 7 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík