557 search results - page 78 / 112 » Visualizing Weighted Edges in Graphs |
IPL
2007
14 years 11 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
DMGT
2011
14 years 2 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
3DPH
2009
15 years 6 days ago
2009
We present a nearly automatic graph-based segmentation method for patient specific modeling of the aortic arch and carotid arteries from CTA scans for interventional radiology simu...
VIP
2003
15 years 13 days ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...