Results 1 to 10 of about 79 (70)
Strength-plasticity synergy from ambient to high temperature via gradient-ordering in boride-reinforced WTaV medium-entropy alloy [PDF]
Nature CommunicationsDeveloping next-generation hypersonic vehicles necessitates structural materials capable of withstanding extreme thermal gradients. However, conventional alloys usually sacrifice room-temperature plasticity for breakthroughs in high-temperature strength.
Bo Sun +8 more
doaj +2 more sources
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj +1 more source
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj +1 more source
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
Computer 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 +1 more source
Networks of causal relationships in the U.S. stock market
Dependence Modeling, 2022 We consider a network-based framework for studying causal relationships in financial markets and demonstrate this approach by applying it to the entire U.S. stock market.
Shirokikh Oleg +6 more
doaj +1 more source
Some Results on Path-Factor Critical Avoidable Graphs
Discussiones Mathematicae Graph Theory, 2023 A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Operations research games: A survey [PDF]
, 2001 Optimization problems, allocation problems, cooperative games, 91-02, 91A12, 90B30, 90B35, 90B10, 90B05,
Borm, P.E.M. +7 more
core +1 more source