-
121
-
122
Historical path of paraphrenia
Published 2021-04-01“…Objectives Develop knowledge about paraphrenia as an individualized diagnostic entity and its historical path through the classical authors’ texts. Methods Extensive research on the historical path of the paraphrenia diagnostic entity was carried out, as well as the current situation of the term. …”
Get full text
Article -
123
-
124
-
125
-
126
Spanning paths in hypercubes
Published 2005-01-01Subjects: “…hamiltonian paths…”
Get full text
Article -
127
Polynomial Path Orders
Published 2013-11-01“…This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. …”
Get full text
Article -
128
Path-Neighborhood Graphs
Published 2013-09-01Subjects: “…path-neighborhood graph…”
Get full text
Article -
129
-
130
-
131
Paths forward in radioglaciology
Published 2022-09-01“…Together, these developments are transforming the field and highlight exciting paths forward for future innovation and investigation.…”
Get full text
Article -
132
-
133
The universal path integral
Published 2016“…This paper defines a universal path integral, which sums over all computable structures. …”
Get full text
Article -
134
Reconfiguring Undirected Paths
Published 2021“…We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. …”
Get full text
Article -
135
-
136
Kanauri am 'path'
Published 2024“…Sharma's recent publications) for `path', which looks so close to general TB and WT lam `path',1 but for the missing initial 1-, that R. …”
Get full text
Journal Article -
137
SPARQL with property paths
Published 2015“…In this paper we tackle all of these problems and show that although the addition of property paths has no impact on query evaluation, they do make the containment and subsumption problems substantially more difficult.…”
Conference item -
138
-
139
Powers of paths in tournaments
Published 2021“…In this short note we prove that every tournament contains the k-th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. …”
Journal article -
140
Disjoint paths in tournaments
Published 2014“…Given k pairs of vertices (si, ti) (1≤i≤k) of a digraph G, how can we test whether there exist k vertex-disjoint directed paths from si to ti for 1≤i≤k? This is NP-complete in general digraphs, even for k=2 [2], but for k=2 there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1]. …”
Journal article