Results 251 to 260 of about 358,315 (287)
Some of the next articles are maybe not open access.
Keyword search over RDF graphs
Proceedings of the 20th ACM international conference on Information and knowledge management, 2011Large 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, 2000In 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
1986
In this chapter, the following will be considered: algorithms involving complete developments (strategy a); algorithms involving partial developments (strategy b); algorithms involving redundant search; e-admissible algorithms.
Igor Aleksander +2 more
openaire +1 more source
In this chapter, the following will be considered: algorithms involving complete developments (strategy a); algorithms involving partial developments (strategy b); algorithms involving redundant search; e-admissible algorithms.
Igor Aleksander +2 more
openaire +1 more source
Investigative Graph Search using Graph Databases
2019 First International Conference on Graph Computing (GC), 2019Identification and tracking of individuals or groups perpetrating latent or emergent behaviors are significant in home-land security, cyber security, behavioral health, and consumer analytics. Graphs provide an effective formal mechanism to capture the relationships among individuals of interest as well as their behavior patterns.
Shashika R. Muramudalige +3 more
openaire +1 more source
Graph Searching on Some Subclasses of Chordal Graphs
Algorithmica, 2000Graph searching is the problem of cleaning the edges of a graph by a minimum number of searchers. An edge is cleaned by having searchers on both endpoints at the same time (node search) or by moving a searcher along this edge (edge search). Lots of equivalent problems are known, for instance, one plus the pathwidth of a graph equals its node search ...
Peng, S.-L. +4 more
openaire +1 more source
Optimal Graph Search with Iterated Graph Cuts
Proceedings of the AAAI Conference on Artificial Intelligence, 2011Informed search algorithms such as A* use heuristics to focus exploration on states with low total path cost. To the extent that heuristics underestimate forward costs, a wider cost radius of suboptimal states will be explored. For many weighted graphs, however, a small distance in terms of cost may encompass a large fraction of the ...
David Burkett, David Hall, Dan Klein
openaire +1 more source
2018
The notion of a graph is a mathematical concept that was introduced to represent a network of objects. The structure of a graph is very basic, and many problems can be modeled using graphs. In this chapter, we learn basic algorithms for searching a graph.
openaire +1 more source
The notion of a graph is a mathematical concept that was introduced to represent a network of objects. The structure of a graph is very basic, and many problems can be modeled using graphs. In this chapter, we learn basic algorithms for searching a graph.
openaire +1 more source
Contiguous Search Problem in Sierpiński Graphs
Theory of Computing Systems, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2009
Many real world problems can be modeled with graphs. This thesis examines two dierent areas of graph searching: the game of Cops and Robber with visibility con- straints and search strategies for nding a specied node on a graph. The game of Cops and Robber is fully characterized in the classic case with one cop.
openaire +1 more source
Many real world problems can be modeled with graphs. This thesis examines two dierent areas of graph searching: the game of Cops and Robber with visibility con- straints and search strategies for nding a specied node on a graph. The game of Cops and Robber is fully characterized in the classic case with one cop.
openaire +1 more source
Graph Searching and Graph Decompositions
2010Graph searching is a game where a team of mobile agents must catch a fugitive hidden in a network (modelled by a graph). Equivalently, graph searching may be defined in terms of clearing a contaminated network. Besides of its practical interests, graph searching has been widely studied for its relationship with important graph parameters, in particular ...
openaire +1 more source