6598 search results - page 182 / 1320 » Graph Theory with Applications |
191
click to vote
ECTEL
2006
Springer
15 years 10 months ago
2006
Springer
In this work informal learning theories and practices and social networking features are taken as starting points to build a reference collaboration model to support collaborative ...
140
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We investigate two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, ...
145
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...
149
click to vote
SIGCOMM
2009
ACM
16 years 28 days ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
168
click to vote
SRDS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...