Results 31 to 40 of about 476,380 (243)

A lower bound for nodal count on discrete and metric graphs

open access: yes, 2006
According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th ...
A.M. Duval   +17 more
core   +3 more sources

Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm [PDF]

open access: yesNeutrosophic Sets and Systems
The A* search algorithm is widely utilized to evaluate the shortest path in a given network. However, in a traditional A* search algorithm, the nodes are assumed to have crisp values, i.e., a single value.
Prasanta Kumar Raut   +4 more
doaj   +1 more source

Modeling of Transport and Logistics Systems and the Study of the Structural Stability

open access: yesУправленческие науки, 2020
The structural stability of the system to external influences is an important parameter of the transport and logistics task. In modern literature, the concept of structural stability is defined as applied to each individual problem, as a result of which ...
D. V. Yatskin   +2 more
doaj   +1 more source

Partitioning Perfect Graphs into Stars

open access: yes, 2016
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three
Bredereck, Robert   +6 more
core   +2 more sources

Anticipation of ventricular tachyarrhythmias by a novel mathematical method: Further insights towards an early warning system in implantable cardioverter defibrillators.

open access: yesPLoS ONE, 2020
Implantable cardioverter defibrillators (ICD) are the most effective therapy to terminate malignant ventricular arrhythmias (VA) and therefore to prevent sudden cardiac death. Until today, there is no way to predict the onset of such VA.
Gabriel S Zamudio   +2 more
doaj   +2 more sources

Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
Interval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob   +4 more
doaj   +1 more source

Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj   +1 more source

A new graph perspective on max-min fairness in Gaussian parallel channels

open access: yes, 2008
In this work we are concerned with the problem of achieving max-min fairness in Gaussian parallel channels with respect to a general performance function, including channel capacity or decoding reliability as special cases.
Boche, Holger, Wiczanowski, Marcin
core   +2 more sources

In vitro properties of patient serum predict clinical outcome after high dose rate brachytherapy of hepatocellular carcinoma

open access: yesMolecular Oncology, EarlyView.
Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser   +14 more
wiley   +1 more source

Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem

open access: yesMathematics, 2016
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj   +1 more source

Home - About - Disclaimer - Privacy