Results 31 to 40 of about 47,764 (259)
Incremental network design with shortest paths [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Baxter +4 more
openaire +2 more sources
Effect of shortest path multiplicity on congestion of multiplex networks
Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial ...
Albert Solé-Ribalta +2 more
doaj +1 more source
Identifying Key Nodes in Complex Networks Based on Global Structure
Quantitative identification of key nodes in complex networks is of great significance for studying the robustness and vulnerability of complex networks.
Yuanzhi Yang +3 more
doaj +1 more source
top-k Path Greedy Generalization Algorithm of Anonymity Shortest Path [PDF]
With the development of social networks,the issues of privacy preservation arouse extensive attention.It can cause privacy disclosure of the shortest path if weighted social network data are protected before its publication.In order to solve this issue ...
CHEN Weihe,DING Leilei
doaj +1 more source
Network orientation via shortest paths [PDF]
AbstractThe graph orientation problem calls for orienting the edges of a graph so as to maximize the number of pre-specified source–target vertex pairs that admit a directed path from the source to the target. Most algorithmic approaches to this problem share a common preprocessing step, in which the input graph is reduced to a tree by repeatedly ...
Dana Silverbush, Roded Sharan
openaire +2 more sources
Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks.
Routing Protocol for Low-power and Lossy Networks (RPL), the de facto standard routing protocol for the Internet of Things (IoT) administers the smooth transportation of data packets across the Wireless Sensor Network (WSN).
Innocent Uzougbo Onwuegbuzie +4 more
doaj +2 more sources
OVERVIEW OF METHODS AND ALGORITHMS OF CONSTRUCTING SHORTEST PATHS AND PROSPECTS OF THEIR DEVELOPMENT
Despite the numerous works related to the problem of finding the shortest paths (SP), attention to the development of speed-efficient algorithms for constructing SP is not reduced.
О.М. Трофимчук +2 more
doaj +1 more source
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu +8 more
wiley +1 more source
Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths
Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng +3 more
doaj +1 more source
ABSTRACT Background Pediatric sarcomas are a heterogeneous group of tumors that contribute disproportionately to cancer mortality in children. Although congenital anomalies are among the strongest known risk factors for childhood cancer, the risk of specific sarcoma subtypes among affected individuals has not yet been thoroughly evaluated. Procedure We
Russ Wolters +17 more
wiley +1 more source

