Results 21 to 30 of about 39 (36)

Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]

open access: yesComputer Science Journal of Moldova, 2005
We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
doaj  

A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S.   +2 more
doaj   +1 more source

Dynamical behaviour of ultrathin [CoFeB (tCoFeB)/Pd] films with perpendicular magnetic anisotropy. [PDF]

open access: yesSci Rep, 2021
Silva AS   +7 more
europepmc   +1 more source

Emergence of Network Motifs in Deep Neural Networks. [PDF]

open access: yesEntropy (Basel), 2020
Zambra M, Maritan A, Testolin A.
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

open access: yesMath Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Home - About - Disclaimer - Privacy