Results 281 to 290 of about 3,018,719 (345)
Impact of low-level laser therapy on orthodontic pain. [PDF]
Front NeurolJagła S +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graph-Based Unsupervised Feature Selection for Interval-Valued Information System
IEEE Transactions on Neural Networks and Learning Systems, 2023Feature selection has become one of the hot research topics in the era of big data. At the same time, as an extension of single-valued data, interval-valued data with its inherent uncertainty tend to be more applicable than single-valued data in some ...
Weihua Xu +3 more
semanticscholar +1 more source
A CHARACTERIZATION OF COMPARABILITY GRAPHS AND OF INTERVAL GRAPHS
Canadian Journal of Mathematics, 1964Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the undirected graph whose vertices are the elements of P, and whose edges (a, b) connect vertices for which either a < b or b < a. A graph G with vertices P for which there exists a partial ordering < such that G = G(P, <) is called a comparability graph.In §
Gilmore, P. C., Hoffman, A. J.
openaire +2 more sources
A Robust Distributed Interval Observer for LTI Systems
IEEE Transactions on Automatic Control, 2023In this article, the state estimation problem of a continuous-time linear time-invariant system is investigated for the situation with unknown external disturbance and measurement noise.
Xiaoling Wang +3 more
semanticscholar +1 more source
Journal of Graph Theory, 1995
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Brauner, Erik O. +2 more
openaire +1 more source
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Brauner, Erik O. +2 more
openaire +1 more source
SIAM Journal on Algebraic Discrete Methods, 1982
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
The Mathematics Teacher, 1961
Interval graphing provides fresh opportunities at all levels of secondary mathematics.
Sheldon T. Rio, Walter J. Sanders
openaire +1 more source
Interval graphing provides fresh opportunities at all levels of secondary mathematics.
Sheldon T. Rio, Walter J. Sanders
openaire +1 more source
Unit Interval Graphs of Open and Closed Intervals
Journal of Graph Theory, 2012AbstractWe give two structural characterizations of the class of finite intersection graphs of the open and closed real intervals of unit length. This class is a proper superclass of the well‐known unit interval graphs.
Rautenbach, Dieter +1 more
openaire +1 more source