Results 51 to 60 of about 405,092 (308)

Graph Coloring Using Eigenvalue Decomposition [PDF]

SIAM Journal on Algebraic Discrete Methods, 1984
A heuristic algorithm for proper vertex colouring of a graph which is based on eigenvectors of the adjacency matrix is proposed in this paper. Signs of coordinates of the eigenvector belonging to the least eigenvalue determine a 2-colouring. This colouring is refined using gradually other eigenvectors in a similar way.
Aspvall, Bengt, Gilbert, John R.
openaire   +1 more source

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

Molecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice, Jose I. Lopez, Aitziber Ugalde‐Olano, Maite Zufiaurre, Ianire Astobiza, Natalia Martin‐Martin, Laura Bozal‐Basterra, Saioa Garcia‐Longarte, Amaia Zabala‐Letona, Sofia Rey, Aida Santos‐Martin, Miguel Unda, Ana Loizaga‐Iriarte, Mariona Graupera, Paolo Nuciforo, Arkaitz Carracedo, Isabel Mendizabal   +16 more
wiley   +1 more source

Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph

Kuwait Journal of Science, 2023
The adjacency matrix of a signed graph has +1 or -1 for adjacent vertices, depending on the sign of the connecting edge. According to this concept, an ordinary graph can be interpreted as a signed graph without negative edges.
Zoran Stanić
doaj   +1 more source

The Grushko decomposition of a finite graph of finite rank free groups: an algorithm

, 2005
A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free groups.
Bestvina, Bridson, Cohen, Guo-An Diao, Jaco, Kharlampovich, Kharlampovich, Lyndon, Mark Feighn, Miller, Serre, Stallings   +11 more
core   +1 more source

The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen, Ali Behram Salar, Abdulkadir Ermis, Erkingul Birday, Lutfu Hanoglu, Bayram Ufuk Sakul   +5 more
wiley   +1 more source

Optimized Time–Frequency Analysis for Induction Motor Fault Detection Using Hybrid Differential Evolution and Deep Learning Techniques

International Journal of Adaptive Control and Signal Processing, EarlyView.
Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva, Avyner Lorran de Oliveira Vitor, Marcelo Favoretto Castoldi, Alessandro Goedtel, Wesley Angelino Souza   +4 more
wiley   +1 more source

Structural Decomposition of Reactions of Graph-Like Objects [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
Inspired by decomposition problems in rule-based formalisms in Computational Systems Biology and recent work on compositionality in graph transformation, this paper proposes to use arbitrary colimits to "deconstruct" models of reactions in which states ...
Tobias Heindel
doaj   +1 more source

On the decomposition of circulant graphs using algorithmic approaches

Alexandria Engineering Journal, 2022
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees,
A. El-Mesady, Y.S. Hamed, H. Shabana
doaj   +1 more source

Highly irregular graph decompositions

Theoretical Computer Science
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien, Marin, Malory, Montero, Leandro, Talon, Alexandre   +3 more
openaire   +2 more sources

Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems

International Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley   +1 more source