3267 search results - page 319 / 654 » Generalized quasirandom graphs |
163
click to vote
IWCMC
2006
ACM
16 years 22 days ago
2006
ACM
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
161
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
161
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
162
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
186
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...