Results 71 to 80 of about 6,109 (206)
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning
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
A multilocus sequence typing approach is proposed to explore Halymorpha halys genetic diversity, taking into consideration both insect nuclear markers and markers from the gut symbiont “Candidatus Pantoa carbekii.” Increased information was revealed regarding the number of distinct holobiont haplotypes in native and invasive populations of the pest ...
Matteo Dho +6 more
wiley +1 more source
P 4-Colorings and P 4-Bipartite Graphs
A vertex partition of a graph into disjoint subsets V i s is said to be a P 4-free coloring if each color class V i induces a subgraph without chordless path on four vertices (denoted by P 4).
Chính T. Hoàng, Van Bang Le
doaj
Complexity of Roman {2}-domination and the double Roman domination in graphs
For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
Abstract Plant–pollinator interactions are fundamental to the functioning of natural ecosystems and the enhancement of agricultural productivity. An effective support of pollinator communities necessitates a comprehensive understanding of the mechanisms underlying pollinator attraction and nutritional preferences.
Pierre Ouvrard +3 more
wiley +1 more source
Making Bipartite Graphs DM-Irreducible
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component.
Bérczi, Kristóf +3 more
openaire +2 more sources
Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms
Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim +2 more
wiley +1 more source
Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham +2 more
wiley +1 more source
Planted Bipartite Graph Detection
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erdős-Rényi random graph over $n$ vertices with edge density $q$.
Asaf Rotenberg +2 more
openaire +2 more sources

