Results 51 to 60 of about 331 (182)
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs [PDF]
SIAM Journal on Computing, 2007 Alon et. al. [N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Combinatorica, 20 (2000), pp. 451-476] showed that every property that is characterized by a finite collection of forbidden induced subgraphs is $\epsilon$-testable. However, the complexity of the test is double-tower with respect to $1/\epsilon$, as the only tool known to construct ...
Noga Alon, Eldar Fischer, Ilan Newman
openaire +1 more source
Nearly Hamilton cycles in sublinear expanders and applications
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter +2 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
F‐purity of binomial edge ideals
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In 2012, Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F‐pure. He proved that weakly closed binomial edge ideals are F‐pure whenever the base field has positive characteristic. He conjectured that: (i) when the base field has characteristic 2, every F‐pure binomial edge ideal comes from a ...
Adam LaClair, Jason McCullough
wiley +1 more source
Two forbidden induced subgraphs and well-quasi-ordering
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Korpelainen, Nicholas, Lozin, Vadim
openaire +2 more sources
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
Optimised Value and Quantity Balancing for Data Collection in Resource‐Constrained UAV‐Aided IoT
IET Wireless Sensor Systems, Volume 16, Issue 1, January/December 2026.This paper addresses the key challenge of efficient multi‐UAV‐aided data collection in resource‐limited IoT environments, necessitating a sophisticated approach to maximise data value while optimising energy use and coverage given the heterogeneity in data value and device distribution.
Ning An +5 more
wiley +1 more source
Generalizing forbidden induced subgraph characterizations of high throttling numbers
, 2022 Zero forcing is a process that models the spread of information throughout a graph as white vertices are forced to turn blue using a color change rule. The idea of throttling, introduced in 2013 by Butler and Young, is to optimize the trade-off between the number of initial blue vertices and the time taken to force all vertices to become blue.
Carlson, Joshua, Kritschgau, Jürgen
openaire +3 more sources
Assigning airport ground handling operations: a data‐driven matheuristic
International Transactions in Operational Research, Volume 33, Issue 1, Page 359-383, January 2026.Abstract In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi‐trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns.
Alexandre Dupaquis +5 more
wiley +1 more source
Contracting Few Edges to Remove Forbidden Induced Subgraphs [PDF]
, 2013 For a given graph property Π (i.e., a collection Π of graphs), the Π-Contraction problem is to determine whether the input graph G can be transformed into a graph satisfying property Π by contracting at most k edges, where k is a parameter. In this paper, we mainly focus on the parameterized complexity of Π-Contraction problems for Π being H-free (i.e.,
Leizhen Cai, Chengwei Guo
openaire +1 more source