Results 151 to 160 of about 4,256 (307)
Le Matematiche, 1992 In this paper, we give the maximal number of (k+r)-colouring of a graph with n vertices and chromatic number k. Also, we obtain the maximal values for chromatic polynomial of a graph.
Dănuţ Marcu
doaj
Exact bounds for distributed graph colouring [PDF]
, 2011 A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a ...
Rybicki, Joel
core
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Friedreich Ataxia (FRDA) is a neurodegenerative disorder of children and young adults associated with cardiomyopathy and other systemic complications. We report a 10‐year‐old girl who presented simultaneously with Acute Myelogenous Leukemia and FRDA who was successfully treated for her leukemia with allogeneic hematopoietic stem cell ...
Alexandra Gitman +5 more
wiley +1 more source
Synchronisation-efficient parallel graph colouring (Extended Abstract) [PDF]
, 2004 The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of graph colouring.
Alexander Tiskin
core
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The prognosis of glioblastoma (GBM) remains highly unfavorable, largely due to high tumor heterogeneity and an immunosuppressive microenvironment. However, the functional role of PANoptosis in this context is poorly understood. Methods Patients were stratified via K‐means clustering. A risk score model was constructed using prognosis‐
Langfei Tian +6 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is a clinically heterogeneous neurodegenerative disease requiring reliable biomarkers to improve patient stratification and trial design. While serum neurofilament light chain (sNfL) reflects neuroaxonal stress and disease aggressiveness, troponin T (TnT) may capture complementary aspects of ...
Julia Sellin +8 more
wiley +1 more source
Graph Colouring by Maximal Evidence Edge Adding (Extended Abstract) [PDF]
, 2007 ) Pete Burge Department of Computer Science Royal Holloway, University of London Email: peteb@dcs.rhbnc.ac.uk John Shawe-Taylor Department of Computer Science Royal Holloway, University of London Email: jst@dcs.rhbnc.ac.uk Janez Zerovnik Faculty of
John Shawe-taylor, Pete Burge
core
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Application of Graph Colouring Algorithm in Course Scheduling Process
KnowbaseScheduling is a crucial aspect in every occurrence, ensuring that all processes are orderly. Gema Nusantara Bukittinggi Health Vocational School currently utilizes Microsoft Excel for managing subject scheduling, which often leads to scheduling conflicts.
Nella Lestari Borotan +3 more
doaj +1 more source