Results 101 to 110 of about 36,227 (305)
Electronic Notes in Discrete Mathematics, 2011 Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source
Annals of Clinical and Translational Neurology, EarlyView.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
Posterior Cortical Atrophy in the Asia‐Pacific: A Report From the PCA Asian Workgroup
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Posterior Cortical Atrophy (PCA) is a distinct dementia syndrome primarily affecting spatial abilities and visual processing. It is associated with degeneration in the posterior part of the brain. PCA is subclassified into PCA‐pure and PCA‐plus syndromes based on consensus criteria.
Yuttachai Likitjaroen +11 more
wiley +1 more source
Partitioning the edges of a graph
Journal of Combinatorial Theory, Series B, 1978 AbstractFor any integer m (≥2), it is known that there are simple graphs of maximum valence m whose edges cannot be coloured with m colours in such a way that adjacent edges shall have different colours. We find those values of m and k for which it is true that every simple graph whose maximum valence does not exceed mk can be coloured with m colours ...
Anthony J. W. Hilton, Rhys Price Jones
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Streaming Graph Partitioning: An Experimental Study
, 2018 Graph partitioning is an essential yet challenging task for massive graph analysis in distributed computing. Common graph partitioning methods scan the complete graph to obtain structural characteristics offline, before partitioning.
Abbas, Zainab, +3 more
core +1 more source
Demonstratio Mathematica, 1984 The author considers two kinds of graphs whose vertices are partial partitions. Let A be a set. A family \(\{A_ i\}_{i\in I}\), \(A_ i\subset A\), is called a partial partition of A (or p-partition) if \(A_ i\cap A_ j=\emptyset\) for any i,j\(\in I\), \(i\neq j\). It is studied the so-called intersection graph of p-partitions of a given set A, i.e.
openaire +2 more sources
Partitioned Probe Comparability Graphs
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David B. Chandler +4 more
openaire +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro +14 more
wiley +1 more source
Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs. [PDF]
Sci Rep, 2023 Sharafeldeen A, Alrahmawy M, Elmougy S.
europepmc +1 more source