Results 221 to 230 of about 149,182 (235)
Some of the next articles are maybe not open access.
Beyond Clustered Planar Graphs
2020Many real-world networks exhibit an inherent clustering structure, which may arise from the presence of communities inside the network or from semantic affinities among nodes. Constructing effective visualizations for such networks is a crucial task that poses several practical and theoretical challenges.
Angelini, Patrizio, Da Lozzo, Giordano
openaire +2 more sources
Planar clusters and perimeter bounds
Philosophical Magazine, 2005We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane (theorem 3.1). Along the way, inside the hexagonal honeycomb, we provide minimizers for each n (theorem 2.7).
A. Heppes, F. Morgan *
openaire +1 more source
Planar Tetracoordinate Fluorine in Binary Clusters
ChemPhysChemPlanar tetracoordinate fluorine (ptF) species are rare and exotic due to the extreme electronegativity of fluorine. Herein, a ptF species is predicted in the binary Li4F4− and Na4F4− clusters. The global minimum of the clusters features C2v geometry and are stabilized by significant electrostatic interaction. Moreover, multicenter ionic bonds also play
Kangkan Sarmah +3 more
openaire +2 more sources
Planar tetracoordinate lithium in LiLi4F4+ cluster
The Journal of Chemical PhysicsOver the past 50 years, planar tetracoordinate carbons have attracted significant attention for challenging the classical tetrahedral bonding model proposed by van’t Hoff and Le Bel. While the planar framework has been extended to all other first-row elements beyond carbon, stable ptLi (lithium) compounds remain notably missing.
Lin-hong Miao +3 more
openaire +2 more sources
Hierarchical Planar Correlation Clustering for Cell Segmentation
2015We introduce a novel algorithm for hierarchical clustering on planar graphs we call “Hierarchical Greedy Planar Correlation Clustering” (HGPCC). We formulate hierarchical image segmentation as an ultrametric rounding problem on a superpixel graph where there are edges between superpixels that are adjacent in the image.
Julian Yarkony +2 more
openaire +1 more source
Atomic Embeddability, Clustered Planarity, and Thickenability
Journal of the ACM, 2022Radoslav Fulek, Csaba Tóth
exaly
Monotone Clustered Level Planarity
We consider the combination of the two constrained planarity problems Level- and Clustered Planarity. Traditionally, level-planar drawings with convex clusters have been studied in this setting. Fink et al. (EuroCG 2024) recently introduced a different way of combining level- and clustered planarity by mimicking a classic characterization of clustered ...Fink, Simon D. +3 more
openaire +1 more source
Clustered Planarity (Invited Lecture)
2005ACM -
F. CORTESE, DI BATTISTA, Giuseppe
openaire +1 more source
A new perspective on clustered planarity as a combinatorial embedding problem
Theoretical Computer Science, 2016Ignaz Rutter
exaly