Results 101 to 110 of about 21,959 (221)

Longest cycles in vertex‐transitive and highly connected graphs

Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.
Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan   +4 more
wiley   +1 more source

The Hardness of Subgraph Isomorphism

, 2015
Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it generalizes problems such as Clique, $r$-Coloring, Hamiltonicity, Set Packing and Bandwidth.
Cygan, Marek, Pachocki, Jakub, Socała, Arkadiusz   +2 more
openaire   +2 more sources

MSP: Multiple Sub-graph Query Processing using Structure-based Graph Partitioning Strategy and Map-Reduce

Journal of King Saud University: Computer and Information Sciences, 2019
In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi, R.B.V. Subramanyam, D.V.L.N. Somayajulu   +2 more
doaj   +1 more source

Subgraph Isomorphism in Temporal Networks

, 2016
Temporal information is increasingly available as part of large network data sets. This information reveals sequences of link activations between network entities, which can expose underlying processes in the data. Examples include the dissemination of information through a social network, the propagation of musical ideas in a music sampling network ...
Redmond, Ursula, Cunningham, P��draig   +1 more
openaire   +3 more sources

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

IEEE Access
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen, Thanh Toan Nguyen, Jun Jo, Florent Poux, Shikha Anirban, Tho T. Quan   +5 more
doaj   +1 more source

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP

Applied Sciences
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the
Fangling Leng, Fan Li, Yubin Bao, Tiancheng Zhang, Ge Yu   +4 more
doaj   +1 more source

Planar Subgraph Isomorphism Revisited

, 2009
13 pages, 4 ...
openaire   +5 more sources

Fuzzy graphs and their applications in finding the best route, dominant node and influence index in a network under the hesitant bipolar-valued fuzzy environment

Complex & Intelligent Systems
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja, Jeong Gon Lee, Dhanraj Dhotre, Pravin Mane, Omprakash Sugdeo Rajankar, Antonios Kalampakas, Navin D. Jambhekar, D. G. Bhalke   +7 more
doaj   +1 more source

Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2

Journal of Cheminformatics, 2012
Background Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software.
Ehrlich Hans-Christian, Rarey Matthias
doaj   +1 more source

Homomorphic Preimages of Geometric Cycles

, 2015
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core