Results 71 to 80 of about 21,959 (221)
Fast Construction on a Restricted Budget
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze +2 more
wiley +1 more source
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
IEEE AccessSubgraph matching is a significant problem in several fields, including like social network analysis, chemical compound search, and fraud detection. While current solutions using CPU, graphics processing units (GPUs), and data center field-programmable ...
Roberto Bosio +5 more
doaj +1 more source
(Random) Trees of Intermediate Volume Growth
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
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
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 +3 more
doaj +1 more source
Frequent Subgraph Mining in Outerplanar Graphs [PDF]
, 2010 In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas +2 more
core +1 more source
The contact cut graph and a Weinstein L$\mathcal {L}$‐invariant
Transactions of the London Mathematical Society, Volume 12, Issue 1, December 2025.Abstract We define and study the contact cut graph which is an analogue of Hatcher and Thurston's cut graph for contact geometry, inspired by contact Heegaard splittings (Giroux, Proceedings of the International Congress of Mathematicians, Beijing, 2002; Torisu, Internat. Math. Res. Notices (2000), 441–454).
Nickolas A. Castro +5 more
wiley +1 more source
Accelerating Subgraph Matching Through Advanced Compression and Label Filtering
AlgorithmsEfficiently 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
Application of dynamic expansion tree for finding large network motifs in biological networks [PDF]
PeerJ, 2019 Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks,
Sabyasachi Patra, Anjali Mohapatra
doaj +2 more sources
Computing and Drawing Isomorphic Subgraphs [PDF]
, 2002 The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem resembles the NP-hard largest common subgraph problem.
Sabine Bachl, Franz-Josef Brandenburg
openaire +1 more source