Results 221 to 230 of about 190,756 (265)

Similarity Searching Using Reduced Graphs.

ChemInform, 2003
Reduced graphs provide summary representations of chemical structures. In this work, the effectiveness of reduced graphs for similarity searching is investigated. Different types of reduced graphs are introduced that aim to summarize features of structures that have the potential to form interactions with receptors while retaining the topology between ...
Valerie J, Gillet, Peter, Willett, John, Bradshaw   +2 more
openaire   +2 more sources

Multihierarchical graph search

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
The use of hierarchical graph searching for finding paths in graphs is well known in the literature, providing better results than plain graph searching, with respect to computational costs, in many cases. This paper offers a step forward by including multiple hierarchies in a graph-based model.
J.-A. Fernandez-Madrigal, J. Gonzalez
openaire   +1 more source

Interactive Graph Search

Proceedings of the 2019 International Conference on Management of Data, 2019
We study \em interactive graph search (IGS), with the conceptual objective of departing from the conventional "top-down" strategy in searching a poly-hierarchy, a.k.a.\ a decision graph. In IGS, a machine assists a human in looking for a target node z in an acyclic directed graph G, by repetitively asking questions.
Yufei Tao, Yuanbing Li, Guoliang Li
openaire   +1 more source

Efficient Budgeted Graph Search

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Iterative Budgeted Exponential Search (IBEX) is a general search algorithm that can limit the number of re-expansions performed in common problems like iterative-deepening tree search and search with inconsistent heuristics. IBEX has been adapted into a specific tree algorithm, Budgeted Tree Search (BTS), which behaves like IDA* when the problem ...
Jasmeet Kaur, Nathan R. Sturtevant
openaire   +1 more source

Graph searching on chordal graphs

1996
Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang   +4 more
openaire   +1 more source

Graph Searching and Search Time

2006
Graph searching is the game of capturing a fugitive by a team of searchers in a network. There are equivalent characterizations in terms of path-width, interval thickness, and vertex separation. So far the interest has mainly focused on the search number of a graph, which is the minimal the number of searchers to win the game, and accordingly on the ...
Franz J. Brandenburg, Stephanie Herrmann
openaire   +1 more source

Blocking for external graph searching

Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '93, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nodine, M. H., Goodrich, M. T., Vitter, J. S.   +2 more
openaire   +2 more sources

Keyword search over RDF graphs

Proceedings of the 20th ACM international conference on Information and knowledge management, 2011
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the Semantic-Web data model RDF as a representation model. Querying these knowledge bases is typically done using structured queries utilizing graph-pattern languages such as ...
Elbassuoni, S., Blanco, R.
openaire   +3 more sources

Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics, 2000
In the classical node-search version for a finite simple undirected graph, in a sequence of moves, at every move a searcher is placed at a vertex or is removed from a vertex. Initially all edges are contaminated (uncleared). A contaminated edge \(xy\) is cleared if on \(x\) and \(y\) searchers are placed. A cleared edge \(e\) is recontaminated if there
Fomin, Fedor V., Golovach, Petr A.
openaire   +2 more sources