1327 search results - page 17 / 266 » Path following algorithm for the graph matching problem |
AAAI
2004
15 years 1 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
150
click to vote
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
107
click to vote
DAM
2011
14 years 6 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
119
click to vote
FSTTCS
2008
Springer
15 years 23 days ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...