557 search results - page 63 / 112 » Visualizing Weighted Edges in Graphs |
128
click to vote
WWW
2007
ACM
15 years 11 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...
103
click to vote
WAW
2007
Springer
15 years 5 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...
FOCS
1999
IEEE
15 years 3 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...
132
click to vote
COR
2008
14 years 10 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...
SODA
2004
ACM
15 years 15 days 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 ...