Results 251 to 260 of about 1,058,735 (299)
Review of Welding Technologies for Electronic Precision Equipment: Status, Limitations, and Prospects. [PDF]
Materials (Basel)Cai H +6 more
europepmc +1 more source
White matter fiber bundles enable robust conduction and time-critical signaling despite axon caliber variation. [PDF]
Commun BiolMordhorst L +3 more
europepmc +1 more source
Review on thread profile modification methods for the planetary roller screw mechanism. [PDF]
iScienceSun Y +6 more
europepmc +1 more source
Deep Learning-Based Assessment of Coronary Artery Morphologies for Predicting Responsiveness to Intravascular Lithotripsy. [PDF]
JACC AdvLiu Y, Nezami FR, Edelman ER.
europepmc +1 more source
Proper Helly Circular-Arc Graphs
Lecture Notes in Computer Science, 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 ...
Min Chih Lin, Jayme Luiz Szwarcfiter
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics, 1994The treewidth of a graph is one of the most important graph-theoretic parameters from the algorithmic point of view. However, computing the treewidth and constructing a corresponding tree-decomposition for a general graph is NP-complete. This paper presents an algorithm for computing the treewidth and constructing a corresponding tree-decomposition for
Ravi Sundaram +2 more
openaire +3 more sources
Proceedings of 12th International Conference on Pattern Recognition, 2002
In this contribution we consider in all detail the effect of digitization on circular arcs. Given a specific discrete circular arc we find the set of all continuous arcs which by digitization would result in this pattern. From this characterization we provide optimal estimates of the radius (or curvature) of the original arc.
Worring, M., Smeulders, A.W.M.
openaire +3 more sources
In this contribution we consider in all detail the effect of digitization on circular arcs. Given a specific discrete circular arc we find the set of all continuous arcs which by digitization would result in this pattern. From this characterization we provide optimal estimates of the radius (or curvature) of the original arc.
Worring, M., Smeulders, A.W.M.
openaire +3 more sources
The Clique Operator on Circular-Arc Graphs [PDF]
Discrete Applied Mathematics, 2010 A circular-arc graphG is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is Helly when the arcs satisfy the ...
Min Chih Lin, Jayme Luiz Szwarcfiter
exaly +3 more sources
Circular‐arc digraphs: A characterization
Journal of Graph Theory, 1989AbstractGiven a family F of ordered pairs of sets {(Su,Tu): u ϵ V}, the intersection digraph of F is the digraph with vertices V defined by uv ϵ E(D) if Su ≠ Tv Ø. Interval digraphs are intersection digraphs of families in which every set is an interval, and were characterized in a previous paper by conditions on the adjacency matrix.
Malay K. Sen +2 more
openaire +1 more source