Results 91 to 100 of about 102,063 (249)

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

A Method for the Quality‐Aware Automated Selection of Deployment Technologies

Software: Practice and Experience, Volume 55, Issue 11, Page 1855-1876, November 2025.
ABSTRACT Domain The deployment of distributed multi‐component cloud applications typically requires a combination of multiple heterogeneous deployment technologies. A different combination of deployment technologies should be chosen due to varying deployment qualities, such as the functional suitability and reliability of the deployment technologies ...
Miles Stötzner, Niklas Krieger, Sandro Speth, Marcel Weller, Steffen Becker, Benjamin Weder, Jacopo Soldani, Valentin Morlock   +7 more
wiley   +1 more source

R Package FrF2 for Creating and Analyzing Fractional Factorial 2-Level Designs

Journal of Statistical Software, 2014
This article describes the R package FrF2 for design and analysis of experiments with 2-level factors. The package offers both regular and non-regular fractional factorial 2-level designs, in the regular case with blocking and split plot facilities and ...
Ulrike Grömping
doaj   +1 more source

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

Journal of Graph Theory, Volume 110, Issue 2, Page 127-131, October 2025.
ABSTRACT An oriented graph D is converse invariant if, for any tournament T, the number of copies of D in T is equal to that of its converse − D. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse
Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +4 more
wiley   +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, Chin, George, Choudhury, Sutanay, Feo, John, Holder, Lawrence   +4 more
core  

On Endomorphism Universality of Sparse Graph Classes

Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

Accelerating Subgraph Matching Through Advanced Compression and Label Filtering

Algorithms
Efficiently identifying subgraphs that match a given query graph within large-scale graphs has become a critical focus in both academic and industrial research.
Yanfeng Chai, Jiashu Li, Qiang Zhang
doaj   +1 more source

MODIT: MOtif DIscovery in Temporal Networks

Frontiers in Big Data, 2022
Temporal networks are graphs where each edge is linked with a timestamp, denoting when an interaction between two nodes happens. According to the most recently proposed definitions of the problem, motif search in temporal networks consists in finding and
Roberto Grasso, Roberto Grasso, Giovanni Micale, Alfredo Ferro, Alfredo Pulvirenti   +4 more
doaj   +1 more source

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

GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases

BMC Bioinformatics, 2021
Background Graphs are mathematical structures widely used for expressing relationships among elements when representing biomedical and biological information. On top of these representations, several analyses are performed. A common task is the search of
Nicola Licheri, Vincenzo Bonnici, Marco Beccuti, Rosalba Giugno   +3 more
doaj   +1 more source