Results 71 to 80 of about 6,506,964 (218)
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
Every graph contains a linearly sized induced subgraph with all degrees odd [PDF]
Advances in Mathematics, 2020 Asaf Ferber, Michael Krivelevich
semanticscholar +1 more source
Ultrasound neuromodulation as a novel dementia therapy—Investigation of possible long‐term confounds
Alzheimer's &Dementia: Translational Research &Clinical Interventions, Volume 12, Issue 1, January/March 2026.Abstract INTRODUCTION Ultrasound neuromodulation has emerged as a promising adjunctive therapy in Alzheimer's disease (AD), yet a controversial issue remains: whether its reported long‐term therapeutic effects could be attributed to potential confounds rather than genuine neuromodulatory mechanisms.
Michael Mitterwallner +3 more
wiley +1 more source
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source
Electronics Letters, Volume 62, Issue 1, January/December 2026.This paper investigates how circuit representation, flat SPICE Netlists versus structured PySpice code, influences LLM performance in functional block recognition tasks. Using a benchmark of six analogue comparator circuits derived from a standard educational collection. Our results reveal that most models showed decreased performance on the structured
Andrei Dăescu +3 more
wiley +1 more source
ACT‐Agent: Affinity‐Cross Transformer for Point Cloud Registration via Reinforcement Learning
IET Image Processing, Volume 20, Issue 1, January/December 2026.1. We proposed a point cloud registration framework combining imitation learning and reinforcement learning, which formulates the registration problem as a Markov decision process with discrete action sequences. 2. We designed the Affinity‐Cross Transformer module to enhance the point cloud feature representation and interaction capabilities. 3.
Fengguang Xiong +8 more
wiley +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]
Telfor Journal, 2009 In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj
Section‐Based Crash Risk Analysis Integrating the Effect of Traffic States and Road Geometry
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.This study presents a section‐based crash risk analysis framework that examines the combined effects of traffic conditions and road geometry, with a focus on merging and diverging areas. Findings reveal that diverging sections pose the highest crash risk, especially under significant speed differentials and when the ramp‐to‐mainline flow ratio exceeds ...
Jihu Kim, Yeeun Kim, Hwasoo Yeo
wiley +1 more source
IET Signal Processing, Volume 2026, Issue 1, 2026.Formation control of multi‐autonomous underwater vehicle (AUV) systems is essential for collaborative ocean tasks such as environmental monitoring and resource exploration, but it is hindered by challenges like limited flexibility in formation transformation, model uncertainties, and unknown ocean current disturbances.
Fan Luan +3 more
wiley +1 more source