1274 search results - page 10 / 255 » Graph lambda theories |
AML
1999
13 years 7 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
ARSCOM
2006
13 years 7 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...