Results 31 to 40 of about 23,182 (295)
Synchronized Planarity with Applications to Constrained Planarity Problems [PDF]
, 2020 We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges ...
Fink, Simon D. +2 more
core +1 more source
Planar Depth and Planar Subalgebras
Journal of Functional Analysis, 2002 In [Planar algebras. I (preprint math.QA/9909027)] planar algebras were introduced by \textit{V. F. R. Jones} to get insight in the study of subfactors, especially in the algebraic-combinatorial aspects of the lattice of higher relative commutants. To each extremal type \(II_1\) finite index subfactor inclusion, Jones has associated a spherical \(C^*\)-
Landau, Zeph, Sunder, V.S
openaire +1 more source
Planar Earthmover is not in L_1 [PDF]
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006 We show that any $L_1$ embedding of the transportation cost (a.k.a. Earthmover) metric on probability measures supported on the grid $\{0,1,...,n\}^2\subseteq \R^2$ incurs distortion $Ω(\sqrt{\log n})$. We also use Fourier analytic techniques to construct a simple $L_1$ embedding of this space which has distortion $O(\log n)$.
Assaf Naor, Gideon Schechtman
openaire +4 more sources
Евразийский Кардиологический Журнал, 2022 The aim of the work is to evaluate the planarity of the QRS loop and its relationship with systolic dysfunction of the left ventricle in patients in the subacute period of myocardial infarction (MI).Materials and methods.
E. V. Blinova +9 more
doaj +1 more source
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +3 more sources
Inverse Neutrosophic Planar Graphs and its application in optimizing the expenditure in inter-cropping [PDF]
Neutrosophic Sets and SystemsThough Neutrosophic graphs have high impact on dealing with problems of indeterminacy, it may not directly address all aspects of edge membership degree constraints such as the truth membership degree of all edge is greater than or equal to the minimum ...
Thempaavai J.P, Antony Crispin Sweety C
doaj +1 more source
Clustered Planarity = Flat Clustered Planarity [PDF]
, 2018 The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the hierarchy of the clusters is "flat", i.e., no cluster different from the root contains other clusters.
Pier Francesco Cortese +1 more
openaire +3 more sources
Recognizing IC-Planar and NIC-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of ...
Christian Bachmaier +4 more
openaire +7 more sources
An algorithm for an 𝓁2-homological test for the planarity of a graph
AKCE International Journal of Graphs and Combinatorics, 2020 Given a finite simple graph Γ, one is able to define the presentation of an associate Coxeter group and construct a CW-complex on which the associated Coxeter group acts.
Elizabeth Donovan, Timothy Schroeder
doaj +1 more source
Notes on Maskit's planarity theorem [PDF]
, 2022 We give an account of the Planarity Theorem of Maskit. This gives a classification of finitely generated groups acting effectively properly discontinuously by orientation-preserving homeomorphisms on a planar surface.
Bowditch, B. H., Brian Bowditch
core +1 more source