Results 11 to 20 of about 16,397 (156)
Orthogonal polarity graphs and Sidon sets [PDF]
Journal of Graph Theory, 2014 Determining the maximum number of edges in an $n$-vertex $C_4$-free graph is a well-studied problem that dates back to a paper of Erd\H{o}s from 1938. One of the most important families of $C_4$-free graphs are the Erd\H{o}s-R\'enyi orthogonal polarity ...
Tait, Michael, Timmons, Craig
core +3 more sources
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search [PDF]
IEEE transactions on computers, 2020 Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This article proposes an efficient method
Sanjiang Li, Xiang-Yu Zhou, Yuan Feng
semanticscholar +1 more source
Induced Cycles and Paths Are Harder Than You Think [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 The goal of the paper is to give fine-grained hardness results for the Subgraph Isomorphism (SI) problem for fixed size induced patterns H, based on the k-Clique hypothesis that the current best algorithms for Clique are optimal. Our first main result is
Mina Dalirrooyfard, V. V. Williams
semanticscholar +1 more source
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters [PDF]
International Conference on Learning Representations, 2023 Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph ...
Matthias Lanzinger, Pablo Barcel'o
semanticscholar +1 more source
Isomorphisms between dense random graphs [PDF]
Comb., 2023 We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2.
Erlang Surya, L. Warnke, Emily Zhu
semanticscholar +1 more source
Combinatorics and Algorithms for Quasi-Chain Graphs [PDF]
Algorithmica, 2021 The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced subgraphs, etc ...
Bogdan Alecu +3 more
semanticscholar +1 more source
Machine Learning-Enabled Drug-Induced Toxicity Prediction. [PDF]
Adv Sci (Weinh)Unexpected toxicity accounts for 30% of drug development failures. This review highlights ML innovations in predicting drug‐induced toxicity, emphasizing comparative analyses, interpretable algorithms, and multi‐source data integration. It categorizes toxicity types, summarizes ML models, and organizes key databases, offering strategies to address ...
Bai C, Wu L, Li R, Cao Y, He S, Bo X.
europepmc +2 more sources
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems
AAAI Conference on Artificial Intelligence, 2020 The performance of a branch-and-bound (BnB) algorithm for maximum common subgraph (MCS) problem and its related problems, like maximum common connected subgraph (MCCS) and induced Subgraph Isomorphism (SI), crucially depends on the branching heuristic ...
Yanli Liu, Chu Min Li, Hua Jiang, Kun He
semanticscholar +1 more source
Universal graphs with forbidden subgraphs and algebraic closure [PDF]
, 1998 We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an associated''algebraic ...
Cherlin, Gregory +2 more
core +2 more sources
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism [PDF]
, 2015 Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this paper we show: \[
Kulkarni, Raghav, Podder, Supartha
core +2 more sources