Results 71 to 80 of about 1,956 (175)

Presentations of the braid group of the complex reflection group G(d,d,n)$G(d,d,n)$

Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.
Abstract We show that the braid group associated to the complex reflection group G(d,d,n)$G(d,d,n)$ is an index d$d$ subgroup of the braid group of the orbifold quotient of the complex numbers by a cyclic group of order d$d$. We also give a compatible presentation of G(d,d,n)$G(d,d,n)$ and its braid group for each tagged triangulation of the disk with ...
Francesca Fedele, Bethany Rose Marsh
wiley   +1 more source

SEGCN: a subgraph encoding based graph convolutional network model for social bot detection

Scientific Reports
Message passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test ...
Feng Liu, Zhenyu Li, Chunfang Yang, Daofu Gong, Haoyu Lu, Fenlin Liu   +5 more
doaj   +1 more source

Frequent Subgraph Mining via Sampling with Rigorous Guarantees [PDF]

, 2022
openFrequent subgraph mining is a fundamental task in the analysis of collections of graphs that aims at finding all the subgraphs that appear with more than a user-specified frequency in the dataset.
PELLIZZONI, PAOLO
core  

On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs [PDF]

, 1988
We consider the problems of subgraph homeomorphism with fixed pattern, disjoint connecting paths with bounded number of terminal pairs, recognition, and subgraph isomorphism for some classes of planar graphs.
Lingas, Andrzej, Proskurowski, Andrzej
core   +1 more source

Portfolios of Subgraph Isomorphism Algorithms [PDF]

, 2016
International audienceSubgraph isomorphism is a computationally challenging problem with important practical applications, for example in computer vision, biochemistry, and model checking. There are a number of state-of-the-art algorithms for solving the
Solnon, Christine, Ciaran McCreesh, Mccreesh, Ciaran, Christine Solnon, Kotthoff, Lars, Lars Kotthoff   +5 more
core   +1 more source

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

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

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

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

Symmetry Breaking in Subgraph Isomorphism

, 2007
The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern graph is isomorphic to a subgraph of a target graph. The first part of the paper shows how to detect and break all variable and
Deville, Yves, SymCon'07, the Seventh International Workshop on Symmetry and Constraint Satisfaction Problem, Zampelli, Stéphane, Saïdi, Mohamed Reda, Benhamou, Belaïd   +4 more
core