Results 21 to 30 of about 22,253 (291)
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +1 more source
An introduction to neutron reflectometry [PDF]
EPJ Web of Conferences, 2020 Specular neutron reflectivity is a neutron diffraction technique that provides information about the structure of surfaces or thin films. It enables the measurement of the neutron scattering length density profile perpendicular to the plane of a surface ...
Cousin Fabrice, Fadda Giulia
doaj +1 more source
Simultaneous measurement of distance and thickness of a thin metal plate with an electromagnetic sensor using a simplified model. [PDF]
, 2003 This paper presents a simplified model which can describe the inductance change when an air-core coil is placed next to a thin nonmagnetic metallic plate.
Dickinson, S. J. +8 more
core +1 more source
Editorial for the Special Issue: “Ten Years of Remote Sensing at Barcelona Expert Center”
Remote Sensing, 2020 This book celebrates the ten year anniversary of the Barcelona Expert Center by presenting recent contributions related to the topics on which the team has been working during those years.
Justino Martínez +3 more
doaj +1 more source
Upper Pedicle Breast Flap [PDF]
Revista Brasileira de Cirurgia Plástica, 2020 Introduction: Here we propose a tactic to fill the upper poles of breasts that are emptied by ptosis in primary and secondary cases to obtain anatomically beautiful breasts with sufficient breast volume.
Antônio Roberto Bozola +1 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
On the Book Thickness of 1-Planar Graphs
CoRR, 2015 In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
Md. Jawaherul Alam +2 more
openaire +2 more sources
BMC Emergency Medicine, 2021 Background Ultrasonography (US) is recently used frequently as a tool for airway assessment prior to intubation (endotracheal tube (ETT) placement), and several indicators have been proposed in studies with different reported performances in this regard.
Mehran Sotoodehnia +4 more
doaj +1 more source
How thick is a fault? Fault displacement-thickness scaling revisited [PDF]
, 2006 No abstract ...
Soden, A.M. +9 more
core +1 more source
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source