557 search results - page 23 / 112 » Visualizing Weighted Edges in Graphs |
110
click to vote
IV
2010
IEEE
14 years 9 months ago
2010
IEEE
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
160
click to vote
GIS
2006
ACM
16 years 2 days ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
DNA
2004
Springer
15 years 4 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
93
Voted
MOR
2007
14 years 10 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...