103 search results - page 10 / 21 » Representations of graphs modulo n |
97
Voted
TALG
2008
15 years 3 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 ...
157
Voted
ATAL
2010
Springer
15 years 4 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...
123
Voted
ECCC
1998
15 years 3 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 ...
122
Voted
ISCAPDCS
2003
15 years 5 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...
135
Voted
CORR
2011
Springer
14 years 10 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...