2294 search results - page 88 / 459 » From Path Graphs to Directed Path Graphs |
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graphs are...
114
click to vote
PODS
2010
ACM
15 years 2 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
TCS
2010
14 years 8 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...