Results 101 to 110 of about 157,845 (305)
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka +5 more
core
ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
Theory and Application of Interval-Valued Neutrosophic Line Graphs
Neutrosophic graphs are used to model inconsistent information and imprecise data about any real-life problem. It is regarded as a generalization of intuitionistic fuzzy graphs.
Keneni Abera Tola +2 more
doaj +1 more source
Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure
The efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs ...
Chuan-Min Lee
doaj +1 more source
ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown +6 more
wiley +1 more source
Closed orders and closed graphs
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Crupi Marilena
doaj +1 more source
On intersections of interval graphs
AbstractIf one can associate with each vertex of a graph an interval of a line, so that two intervals intersect just when the corresponding vertices are joined by an edge, then one speaks of an interval graph.It is shown that any graph on v vertices is the intersection (“product”) of at most [12v] interval graphs on the same vertex set.For v=2k, k ...
openaire +2 more sources
Balanced Interval-Valued Fuzzy Graphs [PDF]
In this paper, we discuss notion of ring sum of product interval-valued fuzzy graphs. We define tensor product of two interval-valued fuzzy graphs and shown that the tensor product of two product interval-valued fuzzy graphs is a product interval-valued ...
Rashmanlou, Hossein, Pal, Madhumangal
core
ALDOA Promotes Glycolysis and NLRP3/GSDMD Pyroptosis to Accelerate ALS Progression
ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is characterized by progressive motor neuron degeneration. Glycolytic dysregulation is implicated in disease progression, yet the underlying mechanisms remain unclear. This study investigates how Aldolase A (ALDOA) drives ALS progression through glycolysis‐mediated motor neuron pyroptosis.
Kaixin Yan +9 more
wiley +1 more source
Interval Count of Interval Graphs
The interval count problem is that of determining the smallest number of distinct interval lengths that is sufficient to represent an interval model of a given interval graph. The class of interval graphs is well known, with several applications. This article briefly summarizes my doctorate thesis done on the subject with supervision of Prof.
openaire +1 more source

