Results 21 to 30 of about 358,315 (287)
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bui-Xuan, Binh-Minh +2 more
openaire +2 more sources
Graphs where Search Methods are Indistinguishable [PDF]
Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC), 2021 Graph searching is one of the simplest and most widely used tools in graph algorithms. Every graph search method is defined using some partic-ular selection rule, and the analysis of the corre-sponding vertex orderings can aid greatly in de-vising algorithms, writing proofs of correctness, or recognition of various graph families. We study graphs where
Matjaž Krnc, Nevena Pivač
openaire +5 more sources
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nisse, Nicolas, Soguet, David
openaire +3 more sources
Research on Multi-Hop Reading Comprehension Based on Graph Neural Network with Improved Graph Nodes [PDF]
Jisuanji gongcheng, 2022 Multi-hop reading comprehension requires searching for question-associated information in supporting documents to perform leaping reasoning to answer the question.The entity graphs of existing multi-hop reading comprehension models lack key information ...
SHU Chong, OUYANG Zhi, DU Nisuo, HE Qing, WEI Qin
doaj +1 more source
Knowledge Extraction from Natural Language Requirements into a Semantic Relation Graph [PDF]
, 2020 Knowledge extraction and representation aims to identify information and to transform it into a machine-readable format. Knowledge representations support Information Retrieval tasks such as searching for single statements, documents, or metadata ...
Schlutter, Aaron, Vogelsang, Andreas
core +1 more source
Recognizing Graph Search Trees
Electronic Notes in Theoretical Computer Science, 2019 Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this graph was introduced by Hagerup and Nowak in 1985, and independently by Korach and Ostfeld in 1989 where ...
Beisegel, Jesse +6 more
openaire +3 more sources
Constructing and searching adjustment sets based on a causal graph model
Sichuan jingshen weisheng, 2022 The purpose of this paper was to introduce the basic knowledge of the causal graph model， the contents of the CAUSALGRAPH procedure and the method of constructing and searching adjustment sets based on the CAUSALGRAPH procedure in SAS/STAT.
Hu Chunyan, Hu Liangping
doaj +1 more source
Clearing Contamination in Large Networks [PDF]
, 2014 In this work, we study the problem of clearing contamination spreading through a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any ...
Simpson, Michael +2 more
core +1 more source
Loopedia, a Database for Loop Integrals [PDF]
, 2017 Loopedia is a new database at loopedia.org for information on Feynman integrals, intended to provide both bibliographic information as well as results made available by the community.
Bogner, C. +9 more
core +2 more sources
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching [PDF]
, 2012 International audienceWe tackle a practical version of the well known {\it graph searching} problem, where a team of robots aims at capturing an intruder in a graph. The robots and the intruder move along the edges of the graph. The intruder is invisible,
Blin, Lélia +2 more
core +4 more sources