Results 71 to 80 of about 591,721 (120)

Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs [PDF]

arXiv, 2017
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph $G$ and a source node $s$ the goal is to maintain shortest distances between $s$ and all other nodes in $G$ under a sequence of online adversarial edge deletions.
arxiv  

Wireless Area Network Infrastructure Model on Gili Ketapang Island Using Open Shortest Path First Routing Protocol

, 2022
Diah Ayu RetnaniWulandari, Yudha Alif Auliya, Antonius CahyaPrihandoko, Slamin Slamin, Mohammad Zarkasi   +4 more
openalex   +2 more sources

Packing Short Cycles [PDF]

arXiv
Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\"orklund, Husfeldt, ICALP 2014; Mari, Mukherjee, Pilipczuk, and Sankowski, SODA 2024] or request the paths to ...
arxiv  

Shortest Path Algorithms between Theory and Practice [PDF]

arXiv, 2019
Utilizing graph algorithms is a common activity in computer science. Algorithms that perform computations on large graphs are not always efficient. This work investigates the Single-Source Shortest Path (SSSP) problem, which is considered to be one of the most important and most studied graph problems.
arxiv  

Finding a Shortest Non-zero Path in Group-Labeled Graphs [PDF]

arXiv, 2019
We study a constrained shortest path problem in group-labeled graphs with nonnegative edge length, called the shortest non-zero path problem. Depending on the group in question, this problem includes two types of tractable variants in undirected graphs: one is the parity-constrained shortest path/cycle problem, and the other is computing a shortest ...
arxiv  

Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter [PDF]

arXiv
In this paper, we study the computation of shortest paths within the \emph{geometric amoebot model}, a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts.
arxiv  

Least-Cost-Path and Closest Facility Analysis for Generating District Heating Networks on a Communal Level

Applied Sciences
Due to an urgent need to reduce the fast-progressing climate changes, a rapid, standardized and replicable solution for the infrastructure restructuring of the heat demand coverage of buildings at the district and city levels must be developed.
Aneta Strzalka, Jacek Malicki, Jan Blachowski   +2 more
doaj   +1 more source

Open shortest path first (OSPF) routing protocol simulation [PDF]

, 1993
Deepinder P. Sidhu, Tayang Fu, Shukri Abdallah, Raj Nair, R. Coltun   +4 more
openalex   +3 more sources

Why is the strength of a polymer network so low? [PDF]

arXiv
Experiments have long shown that a polymer network of covalent bonds commonly ruptures at a stress that is orders of magnitude lower than the strength of the covalent bonds. Here we investigate this large reduction in strength by coarse-grained molecular dynamics simulations.
arxiv  

Effectuation in digital multi-sided platform startups: An entrepreneurial journey through open innovation process

Digital Business
A paradox arises in platform-based open innovation, wherein digital Multi-Sided Platform (MSP) firms with little initial co-creation ability can successfully adopt an open innovation strategy that typically requires a high level of co-creation capacity ...
Adhi Setyo Santoso
doaj