Results 91 to 100 of about 2,876,957 (249)
Journal of the Science of Food and Agriculture, EarlyView.Abstract BACKGROUND Intercropping of legumes with cereals enhances resilience, resource efficiency, and nutritional quality in food systems, yet few studies have integrated yield stability with grain quantity and post‐harvest processability. Lentils (Lens culinaris Medik.) and hull‐less barley (Hordeum vulgare L. var.
Filippo Carmenati +6 more
wiley +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
P3-Factorization of complete bipartite graphs
Discrete Mathematics, 1988 Let \(P_ 3\) be a path of 3 points and \(K_{m,n}\) be a complete bipartite graph with partite sets \(V_ 1\) and \(V_ 2\), where \(| V_ 1| =m\) and \(| V_ 2| =n.\) A spanning subgraph F of \(K_{m,n}\) is called a \(P_ 3\)-factor if each component of F is isomorphic to \(P_ 3\). If \(K_{m,n}\) is expressed as a line-disjoint sum of \(P_ 3\)-factors, then
openaire +3 more sources
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
Networks, EarlyView.ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs +2 more
wiley +1 more source
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
Theory and Applications of Graphs, 2018 Given a graph $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum number of vertices $n$ for which any $k$-coloring of the complete graph $K_{n}$ contains either a rainbow triangle or a ...
Colton Magnant
doaj +1 more source
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks
Networks, EarlyView.ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone +3 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs [PDF]
, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Nagoya, Takayuki +2 more
core +1 more source
ADAPT: An Autonomous Forklift for Construction Site Operation
Journal of Field Robotics, EarlyView.ABSTRACT Efficient material logistics are critical in controlling costs and schedules in the construction industry. However, manual material handling remains prone to inefficiencies, delays, and safety risks. Autonomous forklifts offer a solution to streamline on‐site logistics, reducing reliance on human operators and mitigating labor shortages.
Johannes Huemer +12 more
wiley +1 more source
Packing trees in complete bipartite graphs
Discussiones Mathematicae Graph Theory, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources