Results 221 to 230 of about 4,514 (260)

Cilia in the brain display region-dependent oscillations of length and orientation. [PDF]

PLoS Biol
Monfared RV, Abdelkarim S, Derdeyn P, Chen K, Wu H, Leong K, Chang T, Lee J, Versales S, Nauli SM, Beier K, Baldi P, Alachkar A.   +12 more
europepmc   +1 more source

Case Report: Preliminary evaluation of time-resolved imaging of contrast kinetics magnetic resonance imaging for assessing temporal enhancement patterns in small animal head and neck tumors. [PDF]

Front Vet Sci
Hong S, Kim S, Kim E, Yoon J, Choi J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An Efficient Test for Circular-Arc Graphs

SIAM Journal on Computing, 1980
An undirected graph G is called a circular-arc graph if there exists a family of arcs on a circle and a 1–1 correspondence between vertices and arcs such that two distinct vertices are adjacent if and only if the corresponding arcs overlap. Such a family is called a circular-arc model for G.
Alan Tucker
exaly   +3 more sources

Proper Helly Circular-Arc Graphs

, 2007
A circular-arc model M=(C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has the same length then M is a unit circular-arc model and if A satisfies the Helly Property then M is a Helly circular-arc model.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter   +2 more
openaire   +2 more sources

Clique graphs of Helly circular-arc graphs.

Ars Comb., 2001
A graph \(G\) is a Helly circular-arc graph if \(G\) can be represented as the intersection graph of a system of arcs on a circle such that the arcs satisfy the Helly property. The clique graph of \(G\) is the intersection graph of the cliques of \(G\). In the paper, clique graphs of Helly circular-arc graphs are characterized in terms of the existence
Guillermo Durán 0001, Min Chih Lin
openaire   +2 more sources

Treewidth of Circular-Arc Graphs

SIAM Journal on Discrete Mathematics, 1994
It is shown that the treewidth of circular-arc graphs and the corresponding tree-decomposition can be found in \(O(n^ 3)\) time. Let \(G= (V,E)\) be a circular-arc graph corresponding to a family \(\{A_ 0, A_ 1,\dots, A_{n-1}\}\) of arcs on a unit circle. Define a left clique \(S_ i\) by \(S_ i= \{A_ j\mid A_ j\) contains the left end points of \(A_ i\}
Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan   +2 more
openaire   +2 more sources

Stability in circular arc graphs

Journal of Algorithms, 1988
Summary: An algorithm is presented which finds a maximum stable set of a family of n arcs on a circle in O(n log n) time given the arcs as an unordered list of their endpoints or in O(n) time if they are already sorted. If we are given only the circular arc graph without a circular arc representation for it, then a maximum stable set can be found in ...
Martin Charles Golumbic, Peter L. Hammer
openaire   +2 more sources

Polynomial time recognition of unit circular-arc graphs [PDF]

Journal of Algorithms, 2006
We present an efficient algorithm for recognizing unit circular-arc (UCA) graphs, based on a characterization theorem for UCA graphs proved by Tucker in the seventies. Given a proper circular-arc (PCA) graph G, the algorithm starts from a PCA model for G,
Guillermo Duran, Agustin Gravano, Ross M Mcconnell   +2 more
exaly   +1 more source