Results 91 to 100 of about 2,715,030 (252)

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, Markus Murschitz, Matthias Schörghuber, Lukas Reisinger, Thomas Kadiofsky, Christoph Weidinger, Mario Niedermeyer, Benedikt Widy, Marcel Zeilinger, Csaba Beleznai, Tobias Glück, Andreas Kugi, Patrik Zips   +12 more
wiley   +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  

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, Hafiz Mutee ur Rehman, Muhammad Yousaf, Waqas Nazeer, Shin Min Kang   +4 more
doaj   +1 more source

Prediction of Shooting Events in Soccer Videos Using Complete Bipartite Graphs and Players' Spatial-Temporal Relations. [PDF]

Sensors (Basel), 2023
Goka R, Moroto Y, Maeda K, Ogawa T, Haseyama M.   +4 more
europepmc   +1 more source

Non-bipartite graphs of small Mahler measure [PDF]

, 2013
We classify all non-bipartite graphs that have Mahler measurebelow12(1 +√5). (The bipartite case was covered in an earlier paper by thesecond and third authors.
McKee, James, Smyth, Christopher
core  

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

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

Exploring Total Graphs of Complete Bipartite Graphs [PDF]

In a proper vertex coloring for a graph G, we call a vertex a b-vertex whenever this vertex is adjacent to at least one vertex of every color class. The b-chromatic number of a graph is defined to be the greatest integer k such that there exists a proper
Morgan, Dominic L J
core   +1 more source

The local vertex anti-magic coloring for certain graph operations

Heliyon
This 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

Counting shellings of complete bipartite graphs and trees

, 2021
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously.
Gao, Yibo, Peng, Junyao
core   +1 more source