1127 search results - page 35 / 226 » Testing the Expansion of a Graph |
SIAMCOMP
2008
14 years 11 months ago
2008
ASPDAC
2010
ACM
14 years 10 months ago
2010
ACM
120
click to vote
FLAIRS
2006
15 years 1 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
110
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...