Results 121 to 130 of about 96,090 (258)

Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

open access: yesComputer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci   +6 more
wiley   +1 more source

Signed total double Roman dominating functions in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi   +2 more
doaj   +1 more source

Decomposition of Certain Complete Bipartite Graphs into Prisms

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj   +1 more source

Forest edges buffer effects of agricultural management on bee–plant interaction networks

open access: yesEcological Entomology, EarlyView.
Agricultural management effects: Organic and conventional crop margins host similar bee and plant species, but network structure differs: organic farms exhibit higher interaction diversity, conventional farms higher connectance. Role of forest edges: Native forest edges stabilize bee–plant networks by providing continuous floral resources and suitable ...
Samantha Marx de Castro   +6 more
wiley   +1 more source

Floral richness drives flower–insect networks in city gardens and allotments

open access: yesEcological Entomology, EarlyView.
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

The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation

open access: yesThe FEBS Journal, EarlyView.
The middle region (MR) of PACS‐1 controls engagement with specific partner proteins. This manuscript presents the structure of the Furin binding region (FBR) and how interactions with partners are regulated through the interplay between a basic patch in the FBR and an acidic cluster in the MR.
Troy C. Krzysiak   +7 more
wiley   +1 more source

Optimal orientations of subgraphs of complete bipartite graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is min {d(D) |D belongs to D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some subgraphs of
R. Lakshmi   +2 more
doaj  

Linking the Comparison and Graphical Approaches to Bipartite Matching

open access: yesInternational Statistical Review, EarlyView.
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

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

open access: yesInternational Transactions in Operational Research, EarlyView.
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

How to optimise tournament draws: The case of the FIFA World Cup

open access: yesInternational Transactions in Operational Research, EarlyView.
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

Home - About - Disclaimer - Privacy