557 search results - page 35 / 112 » Visualizing Weighted Edges in Graphs |
COLT
2007
Springer
15 years 5 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
GD
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
117
click to vote
PDCAT
2005
Springer
15 years 4 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
INFOVIS
2000
IEEE
15 years 3 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
109
click to vote
SIAMJO
2008
14 years 11 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....