Results 81 to 90 of about 14,658 (182)
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
Journal of Intelligent Systems, 2017 The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj +1 more source
Global Graph Surrogates and Neural Graph Elements for Computational Mechanics
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Machine learning surrogates are increasingly used to accelerate physics‐based simulations by predicting full‐field responses at a fraction of the computational cost. In this contribution, we present two complementary graph‐based approaches for surrogate modelling in computational mechanics.
Rutwik Gulakala, Marcus Stoffel
wiley +1 more source
Hypergraph Learning: From Algorithms to Applications [PDF]
Graphs are a general language for describing and modeling interconnected systems. To learn graph data, Graph Neural Networks (GNNs) have been introduced.
Saifuddin, Khaled Mohammed
core +1 more source
Knee Surgery, Sports Traumatology, Arthroscopy, Volume 34, Issue 11, Page 4219-4234, November 2026.Abstract Purpose To systematically evaluate the performance, methodological quality, and translational barriers of deep learning (DL) models for predicting knee osteoarthritis (KOA) progression from medical imaging. Methods Following PRISMA guidelines, we searched PubMed, Scopus, and Web of Science (inception to June 2026) for peer‐reviewed studies ...
Amna Gillani +5 more
wiley +1 more source
Advanced Intelligent Discovery, Volume 2, Issue 5, October 2026.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Hypergraph regularity and higher arity VC-dimension [PDF]
, 2020 We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be approximated by k-ary ...
Chernikov, Artem, Towsner, Henry
core +1 more source
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Hypergraph cardinality and age.
, 2016 Hypergraph cardinality is shown as a function of age for the age-memory data set (blue) and word memory task of the multi-task data set (pink). Three distinct age groups are present for the age-memory data, while the multi-task ages overlap with the ...
Michael B. Miller (193691) +6 more
core +1 more source
Networks, Volume 88, Issue 3, Page 331-353, October 2026.ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar +2 more
wiley +1 more source
Robustness of the Sauer–Spencer Theorem
Random Structures &Algorithms, Volume 69, Issue 3, October 2026.ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen +3 more
wiley +1 more source