557 search results - page 63 / 112 » Visualizing Weighted Edges in Graphs |
168
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
142
click to vote
WAW
2007
Springer
15 years 9 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
124
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
165
click to vote
COR
2008
15 years 2 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
124
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...