Results 91 to 100 of about 96,090 (258)
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
The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights
Discrete Dynamics in Nature and Society, 2018 The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs ...
Young Chel Kwun +4 more
doaj +1 more source
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
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 +2 more sources
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
The local vertex anti-magic coloring for certain graph operations
HeliyonThis work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
doaj +1 more source
Extreme edge-friendly indices of complete bipartite graphs [PDF]
Transactions on Combinatorics, 2016 Let G=(V,E) be a simple graph. An edge labeling f:E to {0,1} induces a vertex labeling f^+:V to Z_2 defined by $f^+(v)equiv sumlimits_{uvin E} f(uv)pmod{2}$ for each $v in V$, where Z_2={0,1} is the additive group of order 2.
Wai Chee Shiu
doaj
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source
Ethnic integration and the value of innovation
Strategic Management Journal, EarlyView.Abstract Research Summary Organizations have become increasingly ethnically diverse, and this diversity often brings together distinct technological competencies. Understanding how firms can leverage such diversity to produce valuable innovations therefore becomes essential.
Stefano Breschi +2 more
wiley +1 more source
Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang +7 more
wiley +1 more source