Results 11 to 20 of about 1,048,468 (267)
Planar and Quasi-Planar Simultaneous Geometric Embedding [PDF]
The 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 +2 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 AbstractWe consider the notion of planar depth of a planar algebra, viz., the smallest n for which the planar algebra is generated by its ‘n-boxes’. We establish a simple result which yields a sufficient condition, in terms of the principal graph of the planar algebra, for the planar depth to be bounded by k. This suffices to determine the planar depth
V. S. Sunder, Zeph Landau
openaire +2 more sources
On Another Class of Strongly Perfect Graphs
Mathematics, 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
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
Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture [PDF]
, 2009 In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar cover. We construct a finite planar emulator for K_{4,5} - 4K_2.
Archdeacon +10 more
core +2 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.
Maurizio Patrignani +1 more
openaire +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
Algorithmica, 1998 An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves monotonically increasing in the vertical direction. In this paper we introduce and study the concept of quasi-upward planarity.
PAOLA BERTOLAZZI +2 more
openaire +10 more sources
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal of Applied Computer Science & Mathematics, 2016 Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj +1 more source