557 search results - page 20 / 112 » Visualizing Weighted Edges in Graphs |
74
Voted
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
SIAMCOMP
2010
14 years 5 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
WAW
2007
Springer
15 years 5 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
112
click to vote
VL
2009
IEEE
15 years 5 months ago
2009
IEEE
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...