254 search results - page 4 / 51 » Deterministic Soliton Graphs |
129
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
129
click to vote
IPL
2006
15 years 5 months ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
131
click to vote
IFIPTCS
2010
15 years 3 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
139
click to vote
ENTCS
2007
15 years 5 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...