Results 61 to 70 of about 21,959 (221)
Beating Treewidth for Average-Case Subgraph Isomorphism [PDF]
Algorithmica, 2021 For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of the problem, denoted $G$-$\mathsf{SUB}$, and then solves $G$-$\mathsf{SUB}$ in time $O(n^{tw(G)+1})$ where $tw(G)$
openaire +5 more sources
Coxeter's enumeration of Coxeter groups
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In a short paper that appeared in the Journal of the London Mathematical Society in 1934, H. S. M. Coxeter completed the classification of finite Coxeter groups. In this survey, we describe what Coxeter did in this paper and examine an assortment of topics that illustrate the broad and enduring influence of Coxeter's paper on developments in ...
Bernhard Mühlherr, Richard M. Weiss
wiley +1 more source
On the Hilbert series of vertex cover algebras of unmixed bipartite graphs [PDF]
, 2010 We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.Comment: 8 ...
Ion, Cristian
core
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
Combination theorems for Wise's power alternative
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We show that Wise's power alternative is stable under certain group constructions, use this to prove the power alternative for new classes of groups and recover known results from a unified perspective. For groups acting on trees, we introduce a dynamical condition that allows us to deduce the power alternative for the group from the power ...
Mark Hagen +2 more
wiley +1 more source
Frontiers in Physiology, 2023 Introduction: Given the direct association with malignant ventricular arrhythmias, cardiotoxicity is a major concern in drug design. In the past decades, computational models based on the quantitative structure–activity relationship have been proposed to
Huijia Wang +7 more
doaj +1 more source
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Advanced Intelligent Discovery, Volume 1, Issue 3, December 2025.Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +1 more source
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs [PDF]
, 2015 Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the
Agarwal, Khushbu +4 more
core