557 search results - page 21 / 112 » Visualizing Weighted Edges in Graphs |
APPROX
2009
Springer
15 years 5 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
ALGORITHMICA
2010
14 years 11 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
INFOVIS
1999
IEEE
15 years 3 months ago
1999
IEEE
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
WG
2004
Springer
15 years 4 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...