Results 31 to 40 of about 2,455,447 (352)
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. [PDF]
Physical review. E, Statistical, nonlinear, and soft matter physics, 2000 Using computer databases of scientific papers in physics, biomedical research, and computer science, we have constructed networks of collaboration between scientists in each of these disciplines.
M. Newman
semanticscholar +1 more source
A simple proof of distance bounds for Gaussian rough paths [PDF]
, 2013 We derive explicit distance bounds for Stratonovich iterated integrals along two Gaussian processes (also known as signatures of Gaussian rough paths) based on the regularity assumption of their covariance functions.
Riedel, Sebastian, Xu, Weijun
core +1 more source
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I +3 more
core +1 more source
Tidsskrift for Kulturforskning, 2023 The first tourists, trekkers and ramblers in Norway found their way and navigated the paths that ran through pastures, forests and mountains. The paths these first visitors walked on, and indeed the paths we still use walking and trekking today, were ...
Karen V. Lykke
doaj
The Integration Between Urban Design and Architectural Design as A Methodology of Design in Islamic Architecture [PDF]
Journal of Urban ResearchThe initial reading of Mamluks architecture reveals that the forms are governed by urban factors, so it is in correct to understand Mamluks buildings as a container of spaces, but it is a receptacle of a homogeneous mixture of interior architectural ...
Abdullah Mossa Alzahrani +1 more
doaj +1 more source
Graph Planarity by Replacing Cliques with Paths
Algorithms, 2020 This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique.
Patrizio Angelini +7 more
doaj +1 more source
Mathematics, 2018 It is the case that, in certain applications of fuzzy graphs, a t-norm, instead of a minimum, is more suitable. This requires the development of a new theory of fuzzy graphs involving an arbitrary t-norm in the basic definition of a fuzzy graph. There is
John N. Mordeson, Sunil Mathew
doaj +1 more source
On the basis of the direct product of paths and wheels
International Journal of Mathematics and Mathematical Sciences, 1996 The basis number, b(G), of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this paper we determine the basis number of the direct product of paths and wheels.
A. A. Al-Rhayyel
doaj +1 more source
Percursos de regresso ao trabalho após acidente: confronto com novos obstáculos
Laboreal, 2018 This paper discusses the obstacles the injured workers have to face upon their return to work after the accident. Two studies developed in Portugal support the analysis and the reflection on this issue. One of the studies is the outcome of a request from
Cláudia Pereira +2 more
doaj +1 more source
Stability of the path–path Ramsey number
Discrete Mathematics, 2009 For graphs \(G_1, G_2, \dots, G_r\) the Ramsey number \(R(G_1, G_2, \dots, G_r)\) is the smallest positive integer \(n\) such that if the edges of a complete graph \(K_n\) are partitioned into \(r\) disjoint colour classes giving \(r\) graphs \(H_1, H_2, \dots, H_r\), then at least one \(H_i\), \(1\leq i\leq r\), contains a subgraph isomorphic to \(G_i\
András Gyárfás +2 more
openaire +2 more sources