Sciweavers

1327 search results - page 16 / 266
» Path following algorithm for the graph matching problem
Sort
View
DAM
2000
199views more  DAM 2000»
14 years 11 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
15 years 1 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
CSCLP
2007
Springer
15 years 5 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
15 years 6 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
85
Voted
ICWS
2008
IEEE
15 years 1 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan