Results 121 to 130 of about 34,901 (303)
Advanced Robotics Research, EarlyView.Intelligent Sky Guardians (InSkyGuard) is introduced as a four‐drone swarm that autonomously detects, tracks, and safely captures rogue drones using a coordinated net system. Computer vision and leader–follower control architecture enable synchronized enclosure, while integrated failsafes enhance system reliability. Validated through closed‐environment
Joshua Hastings +6 more
wiley +1 more source
LiteTE: Lightweight, Communication-Efficient Distributed-Memory Triangle Enumerating
IEEE Access, 2019 Distributed-memory triangle enumerating has attracted considerable interests due to its potential capability to process huge graphs quickly. However, existing algorithms suffer from low speed due to high communication cost and load imbalance.
Yongxuan Zhang +5 more
doaj +1 more source
Triangle-intersecting families of graphs
Journal of the European Mathematical Society, 2012 A family \mathcal F of graphs is triangle-intersecting if for every G,H\in\mathcal F ,
ELLIS, DC, FILMUS, Y, FRIEDGUT, E
openaire +5 more sources
Disorder‐Induced Extremely Low Thermal Conductivity of Graphite Fluoride
Advanced Science, EarlyView.This article investigates the effect of fluorination on the thermal conductivity of graphite fluoride, demonstrating the relationship between structural modification and thermal conductivity in an extreme case. The record‐low through‐plane thermal conductivity measured in exfoliated graphite fluoride flakes was found to correlate with the wide ...
Wonsik Lee +10 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2019 Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source
The four-in-a-tree problem in triangle-free graphs [PDF]
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question
Nicolas Trotignon +2 more
core
Advanced Science, EarlyView.Soybean employs its circadian clock, governed by GmCCA1, to rhythmically defend against soybean cyst nematodes. The pathogen retaliates by secreting the effector Hg4E02, which hijacks the clock to suppress defense and co‐opt the host's translation machinery for nutrient acquisition.
Xingwei Wang +21 more
wiley +1 more source
Advanced Science, EarlyView.This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo +6 more
wiley +1 more source
Drawings of complete multipartite graphs up to triangle flips
Journal of Computational GeometryFor a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the rotations of
Oswin Aichholzer +7 more
doaj +1 more source
On line graphs of subcubic triangle-free graphs
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources