3267 search results - page 315 / 654 » Generalized quasirandom graphs |
183
click to vote
CGF
2010
15 years 6 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
197
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
148
click to vote
ENTCS
2006
15 years 6 months ago
2006
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
186
click to vote
ENTCS
2007
15 years 6 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...