Results 21 to 30 of about 260,800 (266)
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
Наука и техника, 2007 Following the concept of defect-free manufacturing of master masks of IC on photo-masks, two Belarusian sets of optomechanical equipment for 0,3 5 p and 90 nanometers are presented in the paper. Each of the sets comprises: • Multi-channel laser pattern
S. M. Avakov
doaj +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
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
Obtaining raised density connections by thermosonic microwelding in 3D integrated microcircuits
Tekhnologiya i Konstruirovanie v Elektronnoi Apparature, 2014 The authors consider the processes of obtaining raised density microwelded connections in 3D-integrated microcircuits by the thermosonic microwelding.
V. L. Lanin, I. B. Petuhov
doaj +1 more source
THE ROLE OF Tc-99m MIBI SPECT IN THE EVALUATION OF NON-SMALL CELL LUNG TUMORS
Atatürk Üniversitesi Tıp Fakültesi Cerrahi Tıp Bilimleri Dergisi, 2023 Objective: In this study, it was aimed to investigate the role of Tc-99m MIBI scintigraphy in the diagnosis and evaluation of non-small cell lung cancers and also to evaluate the use of MIBI scintigraphy and MDP bone scintigraphy together in the ...
Münir Demirci
doaj +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