3211 search results - page 265 / 643 » On the Grundy Number of a Graph |
301
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
312
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
154
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
205
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
155
click to vote
ESA
2005
Springer
16 years 4 days ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...