Results 191 to 200 of about 2,881 (227)

Design and validation of a biomechanics device for preclinical arthrofibrosis models. [PDF]

Bone Joint Res
Carstens MF, Meißner N, Weintraub MT, Pichurin O, Morrey ME, Sanchez-Sotelo J, Berry DJ, Thaler R, Abdel MP.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Interval bigraphs and circular arc graphs

Journal of Graph Theory, 2004
AbstractWe prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without two arcs covering the whole circle. We give another characterization of interval bigraphs, in terms of a vertex ordering, that we hope may prove helpful in finding a more efficient ...
Jing Huang
exaly   +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

Longest Paths in Circular Arc Graphs

Combinatorics, Probability and Computing, 2004
It is shown that all maximum length paths of a connected circular arc graph, or a connected interval graph, have non-empty intersection.
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp   +3 more
openaire   +1 more source

Minimum Cuts for Circular-Arc Graphs

SIAM Journal on Computing, 1990
Summary: The problem of finding a minimum cut of n arcs on a unit circle is considered. It is shown that this problem can be solved in \(\Theta\) (n log n) time, which is optimal to within a constant factor. If the endpoints of the arcs are sorted, the problem can be solved in linear time.
D. T. Lee, Majid Sarrafzadeh, Ying-Fung Wu   +2 more
openaire   +2 more sources

Algorithms on circular‐arc graphs

Networks, 1974
AbstractConsider a finite family of non‐empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of arcs on a circularly ordered set is called a circular‐arc graph.
openaire   +2 more sources

Parallel algorithms on circular-arc graphs

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BERTOSSI A. A, MORETTI, SABRINA
openaire   +3 more sources

Independent Sets in Circular-Arc Graphs

Journal of Algorithms, 1995
Summary: This paper presents a linear time algorithm for the independent set problem on circular-arc graphs, previous algorithms for this problem have assumed that the input is a set of circular-arcs and solve the problem in \(O (n)\) time. However, the fastest known algorithm for constructing the circular-arc representation from a set of adjacency ...
Wen-Lian Hsu, Jeremy P. Spinrad
openaire   +2 more sources