Results 31 to 40 of about 139 (108)
We developed a method to support more general and rational reorganization planning, demonstrating its practicality through application to Kobe municipal housing complexes. Using a cost‐effective algorithm with depth‐first search, we considered a larger pool of dwelling units while accounting for practical constraints, such as grouping sale sites and ...
Kouya Inada, Ken Miura
wiley +1 more source
Implementation and evaluation of space-efficient traversal algorithms on succinct de Bruijn graphs
Succinct de Bruijn graphs (dBGs) store a k-mer graph in four to five bits per edge, enabling metagenome assemblers to run on modern computers. Yet standard traversal methods, such as breadth-first search (BFS) with a 32-bit distance array or depth-first ...
Fikrat Talibli
core +1 more source
The strong network orientation problem
Abstract This study presents models and heuristics for solving the strong network orientation problem (SNOP), which can model several tactical optimization problems of setting directions in urban networks. The objective is to set an orientation for each edge in an undirected graph such that the resulting digraph is strongly connected and the total ...
Christophe Duhamel +1 more
wiley +1 more source
A Review of Graph Traversal Algorithms: Techniques and Applications in Network Analysis
This review identifies graph traversal methods as fundamental steps in network analysis that facilitate easy examination of relations within the network. In this review, we plan to discuss multiple graph traversal approaches like depth first search (DFS),
M. Ali, Chreesk Sabah +1 more
core +1 more source
Propagation‐Based Train Rescheduling under Recoverable Delay Disturbances
Real‐time train rescheduling for high‐speed railway (HSR) is a pivotal technique in HSR transportation to efficiently recover train operation under disturbance scenarios. This paper aims to put forward an integrated resolving and rescheduling method considering network delay propagation.
Jun Zhang +4 more
wiley +1 more source
Correlation Constraint Shortest Path over Large MultiRelation Graphs
Multi-relation graphs intuitively capture the heterogeneous correlations among real-world entities by allowing multiple types of relationships to be represented as entity-connecting edges, i.e., two entities could be correlated with more than one type of
Özsu, M. Tamer +3 more
core +1 more source
In industrial environments, efficient indoor transportation is a cornerstone of streamlined operations. However, the availability of high-end robotic transportation systems often poses a challenge for small-scale manufacturers due to their prohibitive ...
Ram Swaroop Bana +5 more
core +1 more source
P Systems as Formal Models for Distributed Algorithms
A P system is a parallel and distributed computational model inspired by the structure and interactions of living cells [55]. Chapter 1 first relates mainstream concepts of distributed computing to distributed features proposed for P systems.
Wu, Huiling
core
GraphOS: Towards Oblivious Graph Processing [PDF]
We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency ...
Javad Ghareh Chamani +4 more
core +1 more source
Web application for visualization of graph algorithms
U ovom diplomskom radu razvijena je web aplikacija za vizualizaciju algoritama nad grafovima. Cilj rada bio je prikazati kako interaktivna i vizualna prezentacija može olakšati razumijevanje složenih algoritamskih postupaka.
Hardi, Mario
core +1 more source

