Sciweavers

557 search results - page 52 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
SOFTVIS
2003
ACM
15 years 4 months ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...
67
Voted
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
15 years 11 months ago
Large human communication networks: patterns and a utility-driven generator
Given a real, and weighted person-to-person network which changes over time, what can we say about the cliques that it contains? Do the incidents of communication, or weights on t...
Nan Du, Christos Faloutsos, Bai Wang, Leman Akoglu
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
15 years 5 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
15 years 3 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
DAM
2000
199views more  DAM 2000»
14 years 11 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang