Sciweavers

1716 search results - page 227 / 344
» Proving Conditional Termination
Sort
View
DAM
2010
92views more  DAM 2010»
15 years 4 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
DEDS
2010
130views more  DEDS 2010»
15 years 4 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras
DM
2008
68views more  DM 2008»
15 years 4 months ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
DM
2008
86views more  DM 2008»
15 years 4 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
ENTCS
2008
83views more  ENTCS 2008»
15 years 4 months ago
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
Diletta Cacciagrano, Flavio Corradini, Jesú...