Results 51 to 60 of about 27,298 (312)

Scalable maximal subgraph mining with backbone-preserving graph convolutions

, 2023
Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories ...
Huynh, Thanh Trung, Nguyen, Thanh Toan, Quan Thanh Tho, Matthias Weidlich, Hongzhi Yin, Aberer, Karl, Weidlich, Matthias, Thanh Toan Nguyen, Thanh Trung Huynh, Tho, Quan Thanh, Quoc Viet Hung Nguyen, Karl Aberer, Nguyen, Quoc Viet Hung, Yin, Hongzhi   +13 more
core   +1 more source

Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching

, 2021
Subgraph query processing (also known as subgraph search) and subgraph matching are fundamental graph problems in many application domains. A lot of efforts have been made to develop practical solutions for these problems.
Choi, Yunyoung, Hyunjoon Kim, KIM, HYUNJOON, Seok-Hee Hong, Hong, Seok-Hee, Wook-Shin Han, Han, Wook-Shin, HAN, WOOK SHIN, Xuemin Lin, Park, Kun Soo, Park, Kunsoo, Yunyoung Choi, Lin, Xuemin, Kunsoo Park   +13 more
core   +1 more source

Spanning Rigid Subgraph Packing and Sparse Subgraph Covering [PDF]

SIAM Journal on Discrete Mathematics, 2018
12 ...
openaire   +2 more sources

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth [PDF]

, 2018
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura   +4 more
openaire   +3 more sources

Pattern matching and pattern discovery algorithms for protein topologies

, 2001
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
Viksna, J, Juris Víksna, Gilbert, D, David Gilbert   +3 more
core   +1 more source

The Largest Subgraph Without A Forbidden Induced Subgraph

Combinatorica
20 ...
Jacob Fox, Rajko Nenadov, Huy Tuan Pham
openaire   +2 more sources

The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.

PLoS ONE, 2013
Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than ...
Sofie Demeyer, Tom Michoel, Jan Fostier, Pieter Audenaert, Mario Pickavet, Piet Demeester   +5 more
doaj   +1 more source

Induced Subgraphs of Induced Subgraphs of Large Chromatic Number

Combinatorica, 2023
AbstractWe prove that, for every graph F with at least one edge, there is a constant $$c_F$$ c F such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at ...
Girao, A, Illingworth, F, Powierski, E, Savery, M, Scott, A, Tamitegama, Y, Tan, J   +6 more
openaire   +4 more sources

On the subgraph query problem [PDF]

Combinatorics, Probability and Computing, 2020
AbstractGiven a fixed graph H, a real number p (0, 1) and an infinite Erdös–Rényi graph G ∼ G(∞, p), how many adjacency queries do we have to make to find a copy of H inside G with probability at least 1/2? Determining this number f(H, p) is a variant of the subgraph query problem introduced by Ferber, Krivelevich, Sudakov and Vieira.
Ryan Alweiss, Chady Ben Hamida, Xiaoyu He, Alexander Moreira   +3 more
openaire   +2 more sources

Polynomial integrality gaps for strong SDP relaxations of Densest Ksubgraph [PDF]

, 2012
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms.
Bhaskara, Aditya, Aravindan Vijayaraghavan, Moses Charikar, Aditya Bhaskara (5418866), Guruswami, Venkatesan, Zhou, Yuan, Vijayaraghavan, Aravindan, Venkatesan Guruswami (5364872), Venkatesan Guruswami, Yuan Zhou (5415881), Aditya Bhaskara, Aravindan Vijayaraghavan (5417837), Yuan Zhou, Charikar, Moses, Moses Charikar (5418863)   +14 more
core   +1 more source