Results 91 to 100 of about 4,514 (260)

Widespread distribution of large silesaurids evidenced by a new record from the Middle Triassic of southwest Gondwana

open access: yesThe Anatomical Record, EarlyView.
The largest silesaurid known from South America is described here, demonstrating that silesaurids reached large body sizes in southwestern Gondwana. This discovery further underscores the widespread geographic distribution and temporal persistence of large silesaurids across Pangea, despite faunal turnovers and environmental events such as the Carnian ...
Rodrigo Temp Müller
wiley   +1 more source

Circular-arc graphs and the Helly property

open access: yesCoRR
In this paper we investigate some problems related to the Helly properties of circular-arc graphs, which are defined as intersection graphs of arcs of a fixed circle. As such, circular-arc graphs are among the simplest classes of intersection graphs whose models might not satisfy the Helly property.
Jan Derbisz, Tomasz Krawczyk
openaire   +2 more sources

Efficient Algorithms for Circular-Arc Containment Graphs

open access: yes, 1987
In the recent past, a wide variety of algorithms have been developed for a class of intersection graphs, called interval graphs. As a generalization of interval graphs, circular-arc graphs have also been studied extensively.
Nirkhe, M.V.
core  

Show Me the Brain!!: A modern approach to neuroanatomy education

open access: yesAnatomical Sciences Education, EarlyView.
Abstract Show Me the Brain!! (SMtB) is a digital system for interactive graphics that is designed to support instruction in neuroanatomy and neuroscience. It will soon be made open‐source and freely available. SMtB bridges medical and traditional neuroanatomy instruction with the computational systems and representational conventions common in ...
Nicholas C. Hindy   +3 more
wiley   +1 more source

Trade‐offs in avian parental care: a review of theory and meta‐analysis of brood size manipulations

open access: yesBiological Reviews, EarlyView.
ABSTRACT The selective forces shaping parental care have been studied for over 50 years. While theoretical and experimental work has yielded qualitative progress, the large body of empirical work testing predictions about parental investment based on life‐history trade‐offs has yet to be synthesized.
Rebekah A. McKinnon   +4 more
wiley   +1 more source

Photogrammetric Reconstruction of 3D Human Anatomical Structures and Augmented Reality via Smartphone Technology

open access: yesClinical Anatomy, EarlyView.
ABSTRACT Limited access to cadavers necessitates the availability of digital resources for anatomy education. Smartphone‐based photogrammetry offers a promising solution for creating three‐dimensional (3D) and augmented reality (AR) models. This study compared two mobile photogrammetry applications (Qlone and Polycam) that have been used in modern ...
Sarita Phukwantong   +3 more
wiley   +1 more source

Efficient Algorithms For All-Pairs Shortest Path Problem On Interval, Directed Path, And Circular-Arc Graphs

open access: yes, 1993
Given a graph G=(V,E), with |V|=N and |E|=M, we present algorithms for the all-pairs shortest path (APSP) problem when G is an interval, directed path, or circular arc graph.
Joshi, D. S.   +2 more
core   +1 more source

Pathophysiologic Consequences of Early Coarctation Stenting in a Longitudinal Porcine Model

open access: yesCatheterization and Cardiovascular Interventions, EarlyView.
ABSTRACT Background Novel stent technologies offer early intravascular treatment options for coarctation (COA). Mid‐to‐long‐term cardiovascular responses to early COA stent interventions are undefined. Aims We studied a porcine model of COA, with and without early stent implantation with serial dilation to adult aortic diameters, aiming to define ...
Leah M. Gober   +7 more
wiley   +1 more source

Hadwiger's Conjecture On Circular Arc Graphs

open access: yes, 2007
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at least k.
Belkale, Naveen
core  

The circular dimension of a graph

open access: yes, 1979
A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a graph G, then a collection of functions {fi}mn=1, each fi mapping each vertex of V into anarc on a fixed circle, is said to define an m-arc intersection ...
Feinberg, Robert B.
core   +1 more source

Home - About - Disclaimer - Privacy