Results 121 to 130 of about 59,275 (246)
Signal Subgraph Estimation Via Vertex Screening
, 2018 Graph classification and regression have wide applications in a variety of domains. A graph is a complex and high-dimensional object, which poses great challenges to traditional machine learning algorithms.
Badea, Alexandra +4 more
core
Recognizing Trees From Incomplete Decks
Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
An induced subgraph characterization of domination perfect graphs [PDF]
, 1995 Igor E. Zvervich, Vadim Zverovich
openalex +1 more source
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley +1 more source
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Multiple vertex coverings by specified induced subgraphs [PDF]
, 2000 Zoltán Füredi +2 more
openalex +1 more source
The multidepot drone general routing problem with duration and capacity constraints
International Transactions in Operational Research, Volume 32, Issue 6, Page 3756-3779, November 2025.Abstract This paper studies the multidepot drone general routing problem with duration and capacity constraints (MDdGRP), an extension of the classical general routing problem with several depots. A fleet of drones with limited flight time and payload, each one located in a different depot, must jointly perform the service.
Teresa Corberán +3 more
wiley +1 more source
Matched Filters for Noisy Induced Subgraph Detection. [PDF]
IEEE Trans Pattern Anal Mach Intell, 2020 Sussman DL +3 more
europepmc +1 more source
Time Variant Node Ranking Technique for Chatbot Neural Graph
Applied AI Letters, Volume 6, Issue 3, October 2025.This study provides an approach to convert a neural graph into a ranking tree and a path to navigate through it. So the chatbot can identify which node is more promising and has a shorter path than other nodes for information retrieval. ABSTRACT This study seeks to put repetitiveness characteristics into AI.
Ahmed Imtiaz +2 more
wiley +1 more source