Results 81 to 90 of about 5,946 (233)

Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3

Journal of Mathematics
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj   +1 more source

The competition graphs of oriented complete bipartite graphs

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano   +3 more
openaire   +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, Luisa Gagliardi, Thomas Yoon   +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, Hongxu Chen, Xiangyu Zhao, Sixiao Zhang, Xiangguo Sun, Qian Li, Hongzhi Yin, Guandong Xu   +7 more
wiley   +1 more source

Boosting Embodied Visual Localisation Through Multi‐Granular Semantics and Multi‐Robot Consensus

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Achieving high accuracy and synergy remains extremely difficult for multi‐robot embodied visual localisation, which suffers from persistent real‐world challenges such as viewpoint ambiguity, appearance variation and dynamic occlusion. Conventional optimisation‐based methods often lead to incorrect feature matching without domain adaptation ...
Wenshuai Wang, Shiyu Liu, Peifeng Jiang, Hong Liu, Runwei Ding   +4 more
wiley   +1 more source

Optimising daily sampling of plant–bee interaction networks

Journal of Animal Ecology, EarlyView.
Daily variation in ecological interaction networks is rarely quantified due to limited temporal sampling, yet network structure may change substantially within a single day. We show that plant–bee networks exhibit strong intraday shifts in composition and structure, and that sampling distributed across key daily periods better captures network ...
Caio S. Ballarin, Jorge Isla, Blanca Arroyo‐Correa, Elena Quintero, Leandro Hachuy‐Filho, Felipe W. Amorim, Pedro Jordano   +6 more
wiley   +1 more source

Drivers of Host–Pathogen Community Assemblages in European Forests and Urban Green Spaces

Integrative Zoology, EarlyView.
ABSTRACT Despite advances in understanding infectious diseases, the persistence and re‐emergence of wildlife pathogens continue to raise public and veterinary health concerns. This study investigates the relationship between biodiversity and rodent‐borne diseases in Europe, focusing on habitat alterations and their impact on rodent diversity.
Vincent Sluydts, Marie Bouilloud, Maxime Galan, Hussein Alburkat, Anaïs Bordes, Vincent Bourret, Valeria Colombo, Luc DeBruyn, Lara Dutra, Jana Eccard, Jasmin Firozpoor, Romain Gallet, Maciej Grzybek, Heikki Henttonen, Jens Jacob, Andrew McManus, Tarja Sironen, Peter Stuart, Caroline Tatard, Benjamin Roche, Herwig Leirs, Nathalie Charbonnel   +21 more
wiley   +1 more source

Generalized Matching Preclusion in Bipartite Graphs

Theory and Applications of Graphs, 2018
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler, Eddie Cheng, Dana Ferranti, Laszlo Liptak, Karthik Nataraj   +4 more
doaj   +1 more source

Link prediction in ecological meta‐networks under extreme taxonomic bias

Methods in Ecology and Evolution, EarlyView.
Abstract Ecological networks offer powerful insights into community function but, without first characterizing these networks accurately, our ability to detect and interpret changes under environmental stress is limited. We develop an extension of the Covariate‐Informed Link Prediction (COIL) framework to reduce bias in ecological link prediction when ...
Jennifer N. Kampe, Camille M. M. DeSisto, David B. Dunson   +2 more
wiley   +1 more source

General Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph

International Journal of Mathematics and Mathematical Sciences, 2007
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs.
R. A. El-Shanawany, M. Sh. Higazy
doaj   +1 more source