Results 11 to 20 of about 3,761 (106)
Networks, Volume 87, Issue 2, Page 111-130, March 2026.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
Teaching Reading as a Complex and Multidimensional Process
The Reading Teacher, Volume 79, Issue 5, March/April 2026.ABSTRACT This article examines the teaching of reading as a complex and multidimensional process amidst current approaches to teaching reading forwarded by new legislation and curricula that have been adopted across the United States. We underscore the importance of a comprehensive understanding of the teaching of early reading by bringing together ...
Faythe Beauchemin +3 more
wiley +1 more source
Geometry of generated groups with metrics induced by their Cayley color graphs
, 2019 Let $G$ be a group and let $S$ be a generating set of $G$. In this article, we introduce a metric $d_C$ on $G$ with respect to $S$, called the cardinal metric.
Suksumran, Teerapong
core +1 more source
Unpacking Entrepreneurial Ecosystem Elements: Insights Into Drivers of Entrepreneurial Activity
Thunderbird International Business Review, Volume 68, Issue 1, Page 3-15, January/February 2026.ABSTRACT Thriving entrepreneurial ecosystems (EEs) are instrumental in new enterprise creation and growth, as they provide vital support for entrepreneurial activity. However, as this support may be context‐specific, the existing literature has yet to capture the contextual factors that shape the contributions of EEs.
Mohamed Yacine Haddoud +4 more
wiley +1 more source
Density version of the Ramsey problem and the directed Ramsey problem [PDF]
, 2016 We discuss a variant of the Ramsey and the directed Ramsey problem. First, consider a complete graph on $n$ vertices and a two-coloring of the edges such that every edge is colored with at least one color and the number of bicolored edges $|E_{RB}|$ is ...
Nagy, Zoltán Lóránt
core +3 more sources
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
, 2019 We show that the class of chordal claw-free graphs admits LREC$_=$-definable canonization. LREC$_=$ is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion.
Grußien, Berit
core +1 more source
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
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
A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs
Journal of Graph Theory, Volume 110, Issue 2, Page 200-208, October 2025.ABSTRACT Let G be a graph in which each edge is assigned one of the colours 1 , 2 , … , m, and let Γ be a subgroup of S m. The operation of switching at a vertex x of G with respect to an element π of Γ permutes the colours of the edges incident with x according to π.
Richard Brewster +2 more
wiley +1 more source
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source