52 search results - page 1 / 11 » A Linear Algorithm for Finding the Invariant Edges of an Edg... |
SIAMCOMP
2002
13 years 4 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
SIAMCOMP
2008
13 years 4 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
ALENEX
2010
13 years 6 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
DEXA
2010
Springer
13 years 5 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...