Results 81 to 90 of about 10,447 (245)
A Note on Lovász Characterization of Perfect Graphs
ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley +1 more source
Soil Contamination Around the Copper Smelter and the Use of Soil Microarthropods as Bioindicators
ABSTRACT Soil contamination from smelter emissions, including heavy metals (HM), rare earth elements (REEs), and sulfur, poses a significant threat to soil ecosystems. In the immediate vicinity of the Głogów Copper Smelter, HM concentrations were several times higher than in more distant forest stands.
Jacek Malica +10 more
wiley +1 more source
The enumeration of bipartite graphs
AbstractThe standard construction of graphs with n connected components is modified here for bicolored graphs by letting Sn × H act on the function space Y∗where X={1,2,…,n}, Y is the set of connected bicolored graphs, and H is the group that interchanges the vertex colors.
openaire +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
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
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
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
On the irregularity of bipartite graphs
Let \(G=(V,E)\) be a finite simple graph. For \(u\in V\), let \(d(u)\) denote the valence of \(u\). For any edge \(e=uv\in E\), the imbalance of \(e\) is \(| d(u)-d(v)| \). The irregularity of \(G\), denoted \(\text{{irr}}(G)\), is the sum of the imbalances of the edges of \(G\). These notions are due to \textit{M. O. Albertson} [Ars Comb. 46, 219--225
Michael A. Henning, Dieter Rautenbach
openaire +1 more source
ADAPT: An Autonomous Forklift for Construction Site Operation
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
Ethnic integration and the value of innovation
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
Forced Multi-Agent Bipartite Consensus Control: Application to Quadrotor Formation Flying
This work investigates the multi-agent bipartite consensus problem in the presence of switching antagonistic interactions. For leaderless multi-agent systems communicating over a structurally balanced sign graph with switching antagonistic interactions ...
Jose A. Guerrero +3 more
doaj +1 more source
Multi-view Clustering Based on Bipartite Graph Cross-view Graph Diffusion [PDF]
Multi-view clustering is an research hotspots in the field of unsupervised learning.Recently,the method based on cross-view graph diffusion uses the complementary information between multiple views to obtain a unified graph for clustering on the basis of
WANG Jinfu, WANG Siwei, LIANG Weixuan, YU Shengju, ZHU En
doaj +1 more source

