Results 21 to 30 of about 564,462 (289)

Strip Planarity Testing for Embedded Planar Graphs [PDF]

open access: yesAlgorithmica, 2016
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G(V,E)$ and a function $γ:V \rightarrow \{1,2,\dots,k\}$ and asks whether a planar drawing of $G$ exists such that each edge is monotone in the $y$-direction and, for any $u,v\in V$ with $γ(u)
Patrizio Angelini   +3 more
openaire   +5 more sources

On Another Class of Strongly Perfect Graphs

open access: yesMathematics, 2022
For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal   +3 more
doaj   +1 more source

Planar and Quasi-Planar Simultaneous Geometric Embedding [PDF]

open access: yesThe Computer Journal, 2014
A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have ...
DI GIACOMO, Emilio   +4 more
openaire   +3 more sources

Synchronized Planarity with Applications to Constrained Planarity Problems

open access: yesACM 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

Planar Earthmover is not in L_1 [PDF]

open access: yes2006 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

APPLICATION OF EQUIPMENT FOR AUTOMATIC CONTROL OF PLANAR STRUCTURES IN MANUFACTURING MASTER MASKS OF INTEGRATED CIRCUITS ON PHOTO-MASKS

open access: yesНаука и техника, 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

open access: yesJournal 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 gunn diode characterisation and resonators elements to realise oscillator circuits [PDF]

open access: yes, 2013
The paper describes the planar Gunn diode, which is well suited to providing milli-metric and tera hertz sources using microwave monolithic integrated circuit (MMIC) technologies. Different planar Gunn electrode geometries are described along with DC, RF
A. Stephen   +23 more
core   +1 more source

Efficient enhancements in spectral domain method to speed up open planar circuit analysis [PDF]

open access: yes, 1998
The spectral domain method is a very fast and powerful technique to analyse planar microwave circuits. Available techniques for simulating the excitation of open planar microwave circuits are not very effective at relatively low frequencies.
Railton, CJ, Balik, HH
core   +1 more source

Computing Planarity in Computable Planar Graphs

open access: yesGraphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire   +3 more sources

Home - About - Disclaimer - Privacy