1493 search results - page 138 / 299 » Local resilience of graphs |
126
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
123
Voted
KR
2004
Springer
15 years 6 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
105
Voted
SIAMCOMP
2008
15 years 28 days ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
110
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
102
Voted
CIA
2006
Springer
15 years 4 months ago
2006
Springer
Imagine a future environment where networks of agents - people, robots and software agents - interact with sophisticated sensor grids and environmental actuators to provide advice,...