Sciweavers

557 search results - page 55 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
14 years 11 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
CGF
2010
121views more  CGF 2010»
14 years 11 months ago
GraphDice: A System for Exploring Multivariate Social Networks
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
Anastasia Bezerianos, Fanny Chevalier, Pierre Drag...
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
15 years 5 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 5 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon
EUROPAR
1999
Springer
15 years 3 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar