Results 41 to 50 of about 351 (173)
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
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
List 3-Coloring Graphs with No Induced P6+rP3 [PDF]
This is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at: https://doi.org/10.1007/s00453-020-00754-yFor an integer t, we let Pt denote the t-vertex path. We write H+G
Huang, Shenwei +3 more
core +1 more source
CAnDE: Entity‐Based Relationship Exploration Using a Cards and Decks Metaphor
We present CAnDE, a visual analytics approach for exploring dynamically defined entities in digital criminal data. Inspired by evidence boards, CAnDE uses a cards and decks metaphor that maps complex concepts to familiar interactions, including rotating, flipping and stacking cards.
K. A. Roggenbuck +2 more
wiley +1 more source
Color-critical Graphs and Hereditary Hypergraphs
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary hypergraph, generalizing the chromatic number.
openaire +3 more sources
Density Conditions for k Vertex‐Disjoint Triangles in Tripartite Graphs
ABSTRACT Let n , k be positive integers such that n ≥ k and G be a tripartite graph with parts A , B , C such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n. Denote the edge densities of G [ A , B ] , G [ A , C ] and G [ B , C ] by α , β and γ, respectively. In this paper, we study edge density conditions for the existence of k vertex‐disjoint triangles in a ...
Mingyang Guo, Klas Markström
wiley +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Abstract Purpose To systematically evaluate the performance, methodological quality, and translational barriers of deep learning (DL) models for predicting knee osteoarthritis (KOA) progression from medical imaging. Methods Following PRISMA guidelines, we searched PubMed, Scopus, and Web of Science (inception to June 2026) for peer‐reviewed studies ...
Amna Gillani +5 more
wiley +1 more source
Color-critical graphs and hypergraphs
Abstract The main purpose of this paper is to present a technique for obtaining constructions of color-critical graphs. The technique consists in reducing color-critical hypergraphs to color-critical graphs, and the constructions obtained generalize and unify known constructions.
openaire +3 more sources
Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erfang Shan, Liying Kang
openaire +3 more sources
Maximal independence and regularity of Al/Si distributions in disordered phyllosilicates 2:1
The distribution of aluminium cations in disordered phyllosilicates is analysed according to the concepts of maximal independence and regularity.As an extension of previous works, we analyse regularity in disordered Al/Si distributions in phyllosilicates 2:1. The method is based on an analysis of maximal independent sets in a labelled quotient graph of
Montauban Moreira de Oliveira Jr +1 more
wiley +1 more source

