Results 31 to 40 of about 564,462 (289)

The Liouville and the intersection properties are equivalent for planar graphs [PDF]

open access: yes, 2012
It is shown that if a planar graph admits no non-constant bounded harmonic function then the trajectories of two independent simple random walks intersect almost ...
Itai Benjamini   +5 more
core   +1 more source

Clustered Planarity = Flat Clustered Planarity [PDF]

open access: yes, 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

Planar Groups [PDF]

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

Single camera three component planar velocity measurements, using two frequency Planar Doppler Velocimetry (2v-PDV) (2005) [PDF]

open access: yes, 2005
The work presented here describes a method that allows three component velocity measurements to be made, quickly and non-intrusively, across a plane in a flow defined by a laser light sheet. The method, two frequency planar Doppler Velocimetry (2v-PDV)
Charrett, Thomas O. H.   +5 more
core   +1 more source

Recognizing IC-Planar and NIC-Planar Graphs

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

Obtaining raised density connections by thermosonic microwelding in 3D integrated microcircuits

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

open access: yesAtatü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

Multilevel Planarity

open access: yesJournal 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   +8 more sources

3D planar velocity measurements, using Mach-Zehnder interferometric-filter-based planar Doppler velocimetry (MZI-PDV) and imaging fibre bundles [PDF]

open access: yes, 2008
Three component planar flow-field measurements are made using imaging fibre bundles to port different views of the measurement plane, defined by a laser light sheet, to a single imaging head.
Charrett, Thomas O. H.   +7 more
core   +1 more source

Ideal based hypergraph of a commutative ring

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
Let R be a commutative ring and k an integer strictly greater than 2. The k-maximal ideal hypergraph to R with vertex set the set of all k-maximal ideals in R and for distinct ideals I1, in the set is an edge of if and only if and the sum of any elements
V. C. Amritha, K. Selvakumar
doaj   +1 more source

Home - About - Disclaimer - Privacy