103 search results - page 10 / 21 » Representations of graphs modulo n |
TALG
2008
13 years 7 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ECCC
1998
13 years 7 months ago
1998
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
ISCAPDCS
2003
13 years 9 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...