Search
Search Results
-
Efficiently computing alternative paths in game maps
Alternative pathfinding requires finding a set of k alternative paths (including the shortest path) between a given source s and a target t ....
-
Does main path analysis prefer longer paths?
Does main path analysis (MPA), in producing the main paths (MPs), invariably choose the longer paths over the shorter ones? This work examines the...
-
Approximation Algorithms for Covering Vertices by Long Paths
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seems to escape from the...
-
Career paths of the International Mathematics Olympiad (IMO) medalists
Each year, six exceptionally talented high school students from each country participate in the International Mathematics Olympiad (IMO). We...
-
Local detour centrality: a novel local centrality measure for weighted networks
Centrality, in some sense, captures the extent to which a vertex controls the flow of information in a network. Here, we propose Local Detour...
-
Reliable multiplex semi-local random walk based on influential nodes to improve link prediction in complex networks
In recent years, the exponential growth of online social networks as complex networks has presented challenges in expanding networks and forging new...
-
Flip** Plane Spanning Paths
Let S be a planar point set in general position, and let \(\mathcal {P}(S)\)...
-
Smoke semantic segmentation with multi-scale residual paths and weighted middle surveillances
Visual smoke segmentation is widely used for fire detection, simulation, human evacuation and pollution monitoring. However, it is challenging to...
-
An Approximation Algorithm for Covering Vertices by \(4^+\) -Paths
This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph...
-
Continuous Length-Bounded Paths Interdiction
Network vulnerability assessment, in which a communication between nodes is functional if their distance under a given metric is lower than a...
-
Accelerating erasure coding by exploiting multiple repair paths in distributed storage systems
High reliability must be ensured in distributed storage systems (DSSs) to maintain the stability of warehouse-scale computing and high-performance...
-
HARPA: hierarchical attention with relation paths for knowledge graph embedding adversarial learning
Knowledge graph embedding (KGE) aims to map the knowledge graph into a low-dimensional continuous vector space and provide a unified underlying...
-
Cross-media web video event mining based on multiple semantic-paths embedding
Web video event mining based on cross-media fusion has become a research hotspot. However, each video is only described by a dozen noisy words,...
-
Network Robustness Improvement Based on Alternative Paths Consideration
Many transportation networks have complex infrastructures (road, rail, airspace, etc.). The quality of service in air transportation depends on...
-
Online learning of network bottlenecks via minimax paths
In this paper, we study bottleneck identification in networks via extracting minimax paths. Many real-world networks have stochastic weights for...
-
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time
Given a plane graph it is known how to compute the union of non-crossing shortest paths. These algorithms do not allow neither to list each single...
-
Mean Value Analysis of Critical Attack Paths with Multiple Parameters
Graphical models like attack trees and attack graphs provide promising approaches to represent and analyze complex cyber infrastructures. One common...
-
Community detection based on improved user interaction degree, weighted quasi-local path-based similarity and frequent pattern mining
Community detection is a significant research area in social networks. Most methods use network topology, but combining it with user interactions...
-
A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood
Quantifying the importance of nodes in complex networks is known as the problem of identifying influential nodes and is considered a critical aspect...
-
Comparative analysis of urban underground public space and user walking paths based on the social network model
The operation status of the underground public space pedestrian system is of varying quality, but decision-makers and operators have no way of...
