4201 search results - page 61 / 841 » Interaction graphs: Additives |
116
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
120
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
141
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
138
click to vote
SPIRE
2007
Springer
15 years 10 months ago
2007
Springer
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
125
click to vote
CAAN
2004
Springer
15 years 9 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...