Results 11 to 20 of about 1,566,979 (286)
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
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 +2 more sources
Journal of Algebraic Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire +2 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 +5 more sources
Planar Octilinear Drawings with One Bend Per Edge [PDF]
, 2014 In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A $
A. Garg +16 more
core +2 more sources
Exceptional planar polynomials [PDF]
, 2014 Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many extensions of
Caullery, Florian +2 more
core +1 more source
Journal of Graph Algorithms and Applications, 2018 In this paper, we introduce and study multilevel planarity, a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a function that assigns a finite set of integers to each vertex.
Lukas Barth +3 more
openaire +5 more sources
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 +2 more sources
IEEE Microwave Magazine, 2006 The development of the broadband antenna for ultrawideband (UWB) applications such as communications, imaging, radar, and localization is discussed. UWB systems are based on transmitting and receiving impulses with extremely wide spectra. As the antennas for UWB should have broad operating bandwidths for impedance matching and high-gain radiation in ...
Cheng, Zhi Ning +5 more
openaire +3 more sources
Synchronized Planarity with Applications to Constrained Planarity Problems
ACM Transactions on Algorithms, 2023 We introduce the problem S ynchronized P lanarity . 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. S ynchronized P
Thomas Bläsius +2 more
openaire +7 more sources