Results 101 to 110 of about 101,745 (269)
Maximum Common Subgraph Isomorphism Algorithms [PDF]
, 2017 Maximum common subgraph (MCS) isomorphism algorithms play an important role in chemoinformatics by providing an effective mechanism for the alignment of pairs of chemical structures. This article discusses the various types of MCS that can be identified
Duesbury, E. +2 more
core
Graphs isomorphic to subgraphs of their line-graphs
Discrete Mathematics, 1982 AbstractAn embedding of graph G into graph H is by defenition an isomorphism of G onto a subgraph of H. It is shown in this paper that every unicycle U embeds in its line-graph L(U), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle in a natural way.
Ralph Tindell, Douglas Bauer
openaire +2 more sources
Refining Tree‐Decompositions so That They Display the k‐Blocks
Journal of Graph Theory, Volume 109, Issue 3, Page 310-314, July 2025.ABSTRACT Carmesin and Gollin proved that every finite graph has a canonical tree‐decomposition ( T , V ) of adhesion less than k that efficiently distinguishes every two distinct k‐profiles, and which has the further property that every separable k‐block is equal to the unique part of ( T , V ) in which it is contained.
Sandra Albrechtsen
wiley +1 more source
Subgraph Isomorphism Algorithm Based on Color Coding [PDF]
, 2016 Tato práce popisuje řešení problému izomorfismu podgrafů pomocí techniky barevného kódování. V práci je popsán problém izomorfismu podgrafů, jeho varianty a jeho aplikace.
Malík Josef
core
A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism [PDF]
2018 IEEE International Conference on Big Data (Big Data), 2018 A useful technique for adversary activity graph analytics is to perform subgraph isomorphism; searching for a specific graph pattern within a larger graph.
Patrick Mackey +4 more
semanticscholar +1 more source
A Jump of the Saturation Number in Random Graphs?
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT For graphs G$$ G $$ and F$$ F $$, the saturation number sat(G,F)$$ sat\left(G,F\right) $$ is the minimum number of edges in an inclusion‐maximal F$$ F $$‐free subgraph of G$$ G $$. In 2017, Korándi and Sudakov initiated the study of saturation in random graphs. They showed that for constant p∈(0,1)$$ p\in \left(0,1\right) $$, whp satG(n,p),Ks=(
Sahar Diskin +2 more
wiley +1 more source
Structural properties of graph products
Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley +1 more source
Induced Minor Free Graphs: Isomorphism and Clique-width
, 2016 Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +1 more source
Exploring Causal Learning Through Graph Neural Networks: An In‐Depth Review
WIREs Data Mining and Knowledge Discovery, Volume 15, Issue 2, June 2025.Graphical abstract of the survey with a taxonomical approach to causal learning with graph neural networks. ABSTRACT In machine learning, exploring data correlations to predict outcomes is a fundamental task. Recognizing causal relationships embedded within data is pivotal for a comprehensive understanding of system dynamics, the significance of which ...
Simi Job +6 more
wiley +1 more source
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source