Results 21 to 30 of about 59,275 (246)
Graphs in which every c edges that form a tree are chords of a common cycle
AKCE International Journal of Graphs and Combinatorics, 2020 Consider the k-connected graphs G in which every edges that form a particular type of induced subgraph must all be chords of a common cycle of G. Extending a few known partial results with and new results exploit the structure of the specified type of ...
Terry A. McKee
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William T. Trotter, Hal A. Kierstead
openaire +3 more sources
Advice Complexity of the Online Induced Subgraph Problem [PDF]
, 2015 Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others.
Komm, Dennis +3 more
core +3 more sources
On Minimal Unique Induced Subgraph Queries
Applied Sciences, 2018 In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +1 more source
Supervised chemical graph mining improves drug-induced liver injury prediction
iScience, 2023 Summary: Drug-induced liver injury (DILI) is the main cause of drug failure in clinical trials. The characterization of toxic compounds in terms of chemical structure is important because compounds can be metabolized to toxic substances in the liver ...
Sangsoo Lim +5 more
doaj +1 more source
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akira Saito +2 more
openaire +3 more sources
Partitioning graphs into induced subgraphs [PDF]
Discrete Applied Mathematics, 2017 Comment: 14 pages, 4 ...
Dušan Knop, Dušan Knop
openaire +4 more sources
Graphs containing finite induced paths of unbounded length [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it contains no infinite
Maurice Pouzet, Imed Zaguia
doaj +1 more source
Long Circuits and Large Euler Subgraphs [PDF]
, 2013 An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree.
A. Golovach, Fedor V. Fomin, Petr
core +1 more source