1327 search results - page 112 / 266 » Path following algorithm for the graph matching problem |
109
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
LATIN
1998
Springer
15 years 6 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
133
click to vote
FCT
2009
Springer
15 years 5 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
116
click to vote
PERCOM
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
121
click to vote
JCP
2006
15 years 1 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...