Results 121 to 130 of about 11,781 (210)

Universality for Graphs of Bounded Degeneracy

open access: yesRandom Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Given a family ℋ$$ \mathscr{H} $$ of graphs, a graph G$$ G $$ is called ℋ$$ \mathscr{H} $$‐universal if G$$ G $$ contains every graph of ℋ$$ \mathscr{H} $$ as a subgraph. Following the extensive research on universal graphs of small size for bounded‐degree graphs, Alon asked what is the minimum number of edges that a graph must have to be ...
Peter Allen   +2 more
wiley   +1 more source

Cyclic Subsets of Tournaments

open access: yesRandom Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Let G$$ G $$ be a Dirac graph, and let S$$ S $$ be a vertex subset of G$$ G $$, chosen uniformly at random. How likely is the induced subgraph G[S]$$ G\left[S\right] $$ to be Hamiltonian? This question, proposed by Erdős and Faudree in 1996, was recently resolved by Draganić, Keevash, and Müyesser, in the setting of graphs.
Zach Hunter   +3 more
wiley   +1 more source

Exploring Regional Biogeography of Abundant and Rare Bacteria in Soils With Long‐Read CycloneSEQ

open access: yesJournal of Sustainable Agriculture and Environment, Volume 5, Issue 1, March 2026.
ABSTRACT Background Rare microbial communities represent an important component of biodiversity in soil ecosystems, co‐existing with abundant species to drive ecosystem multifunctionality and maintain its stable operation. However, knowledge remains limited regarding the geographical distribution patterns and potential driving factors of microorganisms,
Yarong Li   +12 more
wiley   +1 more source

Addressing Complexity in System of Systems With GraphRAG: An AI‐Driven Framework for Dynamic Data Integration

open access: yesSystems Engineering, Volume 29, Issue 2, Page 150-168, March 2026.
ABSTRACT System of Systems (SoS) environments are inherently complex, involving numerous operationally and managerially independent component systems with hidden interdependencies and frequent interactions based on unstructured data. In this paper, we propose using graphical Retrieval‐Augmented Generation (GraphRAG), a tool that combines large language
Yinchien Huang   +2 more
wiley   +1 more source

Mission Aware Cyber‐Physical Security

open access: yesSystems Engineering, Volume 29, Issue 2, Page 354-367, March 2026.
ABSTRACT Perimeter cybersecurity, while essential, has proven insufficient against sophisticated, coordinated, and cyber‐physical attacks. In contrast, mission‐centric cybersecurity emphasizes finding evidence of attack impact on mission success, allowing for targeted resource allocation to mitigate vulnerabilities and protect critical assets.
Georgios Bakirtzis   +3 more
wiley   +1 more source

eMap 2.0: A Web‐Based Platform for Identifying electron Transfer Pathways in Proteins and Protein Families

open access: yesWIREs Computational Molecular Science, Volume 16, Issue 2, March/April 2026.
In this review, we present eMap 2.0, a web‐based platform for analyzing electron transfer pathways in proteins. We highlight representative applications of eMap, including its use in characterizing electron transfer within individual proteins and in revealing shared electron transfer pathways across protein families.
James R. Gayvert   +3 more
wiley   +1 more source

TSG‐Net: A Multiscale Decomposition and Spatio‐Temporal Graph Neural Network Framework for High‐Precision Wind Power Forecasting

open access: yesWind Energy, Volume 29, Issue 3, March 2026.
ABSTRACT Wind energy's intermittency poses significant challenges for power grid stability. Existing forecasting methods exhibit notable limitations: traditional machine learning models struggle with long‐term temporal dependencies, while deep learning approaches often overlook spatial relationships among turbines.
YuChen Zhang
wiley   +1 more source

Critical Review for One‐Class Classification: Recent Advances and Reality Behind Them

open access: yesWIREs Data Mining and Knowledge Discovery, Volume 16, Issue 1, March 2026.
This review presents a new taxonomy to summarize one‐class classification (OCC) algorithms and their applications. The main argument is that OCC should not learn multiple classes. The paper highlights common violations of OCC involving multiple classes.
Toshitaka Hayashi   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy