247 search results - page 27 / 50 » Scalable propagation-based call graph construction algorithm... |
112
Voted
JMLR
2006
15 years 1 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
111
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
72
Voted
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
105
click to vote
TCS
2008
15 years 1 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
94
Voted
JGT
2010
15 years 7 days ago
2010
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...