Results 71 to 80 of about 814 (113)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm

open access: yes, 2017
Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core  

A duality based 2-approximation algorithm for maximum agreement forest. [PDF]

open access: yesMath Program, 2023
Olver N   +4 more
europepmc   +1 more source

Special issue on: Computational discrete optimization

open access: yesEURO Journal on Computational Optimization, 2020
ArieM.C.A. Koster, Clemens Thielen
doaj   +1 more source

RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]

open access: yesMultiscale Model Simul, 2018
Heroy S   +4 more
europepmc   +1 more source

A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]

open access: yesBiomimetics (Basel)
Crawford B   +9 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy