Results 61 to 70 of about 55,019 (192)
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 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
On a Clique‐Building Game of Erdős
Journal of Graph Theory, Volume 113, Issue 2, Page 208-221, October 2026.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a K n
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
The subgraph isomorphism problem for outerplanar graphs [PDF]
, 1982 This paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete.
SysŁ;o, Maciej M.
core +1 more source
On the maximum likelihood degree of Gaussian graphical models
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML‐degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML‐degree of the nth$n{\rm th}$ cycle is larger than 1 for any n⩾4$n\geqslant 4$, therefore completing the characterization ...
Carlos Améndola +3 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
Sharp restriction estimates for some degenerate higher codimensional quadratic surfaces
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract The Fourier restriction conjecture is a fundamental problem in harmonic analysis. In this paper, we investigate restriction estimates for degenerate higher codimensional quadratic surfaces and obtain sharp results for some types of degenerate cases.
Zhenbin Cao, Changxing Miao, Yixuan Pang
wiley +1 more source
Symmetry breaking in the subgraph isomorphism problem [PDF]
The Subgraph Isomorphism Problem has many applications, including bioinformatics, computer vision and graph databases. Current state-of-the-art solvers using constraints programming techniques can handle cases with up to 1000 pattern vertices and 10,000 ...
Loughney, Joseph Patrick, Hoffmann, Ruth
core +5 more sources
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Journal of Graph Algorithms and Applications, 2018 Schietgat, Ramon and Bruynooghe [Schietgal et al., AMAI, 2013] proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs.
Nils Kriege +2 more
doaj +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source