Results 191 to 200 of about 1,017,247 (314)
Clique-inverse graphs of bipartite graphs [PDF]
, 2004 The clique graph K (G) of a given graph of the collection of maximal cliques of G. Given a family F of graphs, the clique-inverse graphs of F are the graphs whose clique graphs belong to F.
Protti, Fábio, Szwarcfiter, Jayme Luiz
core
Geometry‐Aware Alignment and Comparison of Hierarchical Morse Complexes with Applications
Computer Graphics Forum, EarlyView.Abstract Scalar fields derived from 3D X‐ray CT scans of samples undergoing ex situ processes, such as thermal aging, chemical etching, or mechanical stress, pose unique challenges for characterizing similarities and differences across acquisitions. Typically, a sample A (source) is imaged, removed, and subjected to experimental conditions that alter ...
Aniketh Venkat +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1981 AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) where |A| = a ≥ 2, |B| = b ≥ k ≥ 2, and each vertex of A has degree at least k. We prove two results concerning the existence of cycles in G(a, b, k).
openaire +2 more sources
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer 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
The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation
The 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
Insect Conservation and Diversity, EarlyView.Primary forests hosted more diurnal species and exhibited significant diel specialization. Secondary forests were less species‐rich, dominated by invasive ants, with reduced diel partitioning and more species active at night. Although the overall ant activity was higher during the day, this pattern was stratum‐dependent: arboreal and terrestrial ants ...
Jan Lenc +4 more
wiley +1 more source
Linking the Comparison and Graphical Approaches to Bipartite Matching
International 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
International 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
Biclique: an R package for maximal biclique enumeration in bipartite graphs. [PDF]
BMC Res Notes, 2020 Lu Y, Phillips CA, Langston MA.
europepmc +1 more source
Constructing cospectral graphs by unfolding non-bipartite graphs [PDF]
In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices.
Wankhede, Hitesh +2 more
core +2 more sources