Results 211 to 220 of about 47,764 (259)
Harary index of the zero divisor graph of upper triangular matrices. [PDF]
Sci RepAlshanqiti O, Sharma S, Bhat VK.
europepmc +1 more source
GeoGraphNetworks: A comprehensive benchmark dataset for accurate and scalable graphical representations. [PDF]
Data BriefSharma H, Mooney P, Galván E.
europepmc +1 more source
Network formation and dynamics among multi-LLMs. [PDF]
PNAS NexusPapachristou M, Yuan Y.
europepmc +1 more source
Quantifying edge relevance for epidemic spreading via the semi-metric topology of complex networks. [PDF]
J Phys ComplexSoriano-Paños D +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Shortest-path queries in static networks
ACM Computing Surveys, 2014We consider the point-to-point (approximate) shortest-path query problem , which is the following generalization of the classical single-source (SSSP) and all-pairs shortest-path (APSP) problems: we are first presented with a network (graph) . A
exaly +2 more sources
Shortest Paths in Time-Dependent FIFO Networks
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Dehne, Jörg-Rüdiger Sack
exaly +2 more sources
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems, 2012Shortest path query is one of the most fundamental queries in spatial network databases. There exist algorithms that can process shortest path queries in real time. However, many complex applications require more than just the calculation of a single shortest path.
Kexin Xie, Ke Deng, Shuo Shang
exaly +4 more sources
Shortest‐path network interdiction
Networks, 2002AbstractWe study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget.
Eitan Israeli, R. Kevin Wood
openaire +3 more sources
On the shortest path to network security
Proceedings of 9th Annual Computer Security Applications Conference, 2002The resource constrained shortest path model is a general framework for evaluating and understanding the security of computer networks. This paper derives the model from established computer security and risk analysis principles to provide an informal proof that a network security model based on the resource constrained shortest path is "correct". Thus
John A. Fitch III, Lance J. Hoffman
openaire +1 more source
Shortest paths in stochastic networks
Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955), 2005This paper discusses the sensitivity of network flows to uncertain link state information for various routing protocols. We show that the choice of probability distribution for the link metrics for a given network can have markedly different effects on the probabilities of path selection.
Bill Lloyd-Smith +3 more
openaire +1 more source