557 search results - page 22 / 112 » Visualizing Weighted Edges in Graphs |
82
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
NIPS
2003
15 years 12 days ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
DEXA
2010
Springer
14 years 11 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
WEA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
108
Voted
IWPC
2008
IEEE
15 years 5 months ago
2008
IEEE
Many program comprehension tools use graphs to visualize and analyze source code. The main issue is that existing approaches create graphs overloaded with too much information. Gr...