Results 61 to 70 of about 312 (179)
Forbidden Pairs and (k,m)-Pancyclicity
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj +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
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
Forbidden Subgraphs and Complete Partitions
The Electronic Journal of CombinatoricsA graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an $H$-free $(r,k)$-graph.
Byrne, John +2 more
openaire +2 more sources
Forbidden subgraphs and the König–Egerváry property
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bonomo, F. +5 more
openaire +7 more sources
Face Sizes and the Connectivity of the Dual
Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source
A general framework on conditions for constraint‐based causal learning
Scandinavian Journal of Statistics, Volume 52, Issue 4, Page 2209-2241, December 2025.Abstract Most constraint‐based causal learning algorithms provably return the correct causal graph under certain correctness conditions, such as faithfulness. By representing any constraint‐based causal learning algorithm using the notion of a property, we provide a general framework to obtain and study correctness conditions for these algorithms. From
Kai Z. Teh, Kayvan Sadeghi, Terry Soo
wiley +1 more source
The Largest Subgraph Without A Forbidden Induced Subgraph
Combinatorica20 ...
Fox, Jacob +2 more
openaire +2 more sources
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Applied Stochastic Models in Business and Industry, Volume 41, Issue 6, November/December 2025.ABSTRACT Malware detection poses a critical challenge for both society and Business and Industry (B&I), particularly given the necessity for secure digital transformation. Among various cybersecurity threats, ransomware has emerged as especially disruptive, capable of halting operations, interrupting business continuity, and causing significant ...
Danilo Bruschi +3 more
wiley +1 more source