721 search results - page 51 / 145 » Graphs with Large Obstacle Numbers |
138
click to vote
LCN
2007
IEEE
16 years 8 days ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
289
click to vote
ICDE
2003
IEEE
16 years 7 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...
140
click to vote
KRDB
1998
15 years 7 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
163
click to vote
BCB
2010
2010
Fast graph approaches to measure influenza transmission across geographically distributed host types
15 years 1 months ago
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
144
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...