Results 51 to 60 of about 2,449,773 (154)
Quantitative Metrics for Edge Bundling of Network Visualizations
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
Floral richness drives flower–insect networks in city gardens and allotments
Floral richness was the main driver of flower visits within green spaces whilst green space in the surrounding landscape influenced flower visits by amplifying the effects of floral richness. Native plants received more visits than non‐native plants, although flower visitor richness to non‐native plants increased later in the season as non‐native plant
Emma Plant +4 more
wiley +1 more source
Engineering Ferrimagnetic Interactions in Molecular Quantum Systems
Heterospin nanographene architectures—constructed by covalently linking spin‐1/2$\nicefrac {1}{2}$ and spin‐1 triangular units via on‐surface synthesis—are characterized by bond‐resolved scanning probe microscopy. Inelastic electron tunneling spectroscopy probes exchange interactions within a Heisenberg model, revealing both compensated (S=0$S=0$) and ...
Elia Turco +8 more
wiley +2 more sources
Linking the Comparison and Graphical Approaches to Bipartite Matching
Summary Bipartite record linkage has the goal of identifying observations referring to the same individual, called coreferent observations, across two distinct non‐duplicated datasets. The two main approaches to solve this task are the Fellegi–Sunter model, which relies on pairwise comparisons of observations, and the graphical record linkage model ...
Edoardo Redivo
wiley +1 more source
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Bisimplicial edges in bipartite graphs [PDF]
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to nd such edges in bipartite graphs. The expected time complexity of our new
Manthey, Bodo; id_orcid +4 more
core +1 more source
ABSTRACT Bariatric surgery (BS) has short‐ and medium‐term benefits in improving metabolic syndrome (MetS) components, but its long‐term impact remains incompletely characterized. This systematic review and meta‐analysis aimed to quantify the long‐term effects of BS (≥ 5 years) on fasting blood glucose (FBG), HDL cholesterol, triglycerides (TG), waist ...
Bernardo Paz Barboza +7 more
wiley +1 more source
Efficient and Effective Cohesive Subgraph Search in Bipartite Graphs
Bipartite graphs are an interesting structure that can model the relationships between two different types of entities in real-world scenarios such as customer-product and author-paper networks.
Aman Abidi (19120876)
core +1 more source
How to optimise tournament draws: The case of the FIFA World Cup
Abstract The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade‐off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform ...
László Csató
wiley +1 more source

