Sciweavers

158 search results - page 8 / 32
» A Self-stabilizing Algorithm for Graph Searching in Trees
Sort
View
ICALP
2004
Springer
14 years 15 days ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 18 days ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
14 years 1 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
OPODIS
2008
13 years 8 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
BMCBI
2011
12 years 10 months ago
RAG: An Update to the RNA-As-Graphs Resource
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
Joseph A. Izzo, Namhee Kim, Shereef Elmetwaly, Tam...