561 search results - page 22 / 113 » Shortest-Path Kernels on Graphs |
OTM
2010
Springer
13 years 7 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
ORL
2008
13 years 9 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
CCR
1998
13 years 9 months ago
1998
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
ICFEM
2000
Springer
14 years 1 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
SODA
1998
ACM
13 years 11 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...