Results 291 to 300 of about 3,546,741 (346)
Some of the next articles are maybe not open access.
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.
Elizabeth S. N. Sneyd +2 more
openaire +2 more sources
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.
Elizabeth S. N. Sneyd +2 more
openaire +2 more sources
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
R. Leibowitz, G. W. Peck, S. F. Assmann
openaire +3 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
R. Leibowitz, G. W. Peck, S. F. Assmann
openaire +3 more sources
Interval digraphs: An analogue of interval graphs
Journal of Graph Theory, 1989AbstractIntersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uv in the intersection digraph when the “source set” of u intersects the “terminal set” of v.
Aniruddha Roy +3 more
openaire +3 more sources
1980
Publisher Summary This chapter discusses the properties, characterization, and theorems of interval graphs. The earliest characterization of interval graphs was obtained by Lekerkerker and Boland. Their result embodies the notion that an interval graph neither can branch into more than two directions nor can circle back onto itself. Theorem by Gilmore
openaire +3 more sources
Publisher Summary This chapter discusses the properties, characterization, and theorems of interval graphs. The earliest characterization of interval graphs was obtained by Lekerkerker and Boland. Their result embodies the notion that an interval graph neither can branch into more than two directions nor can circle back onto itself. Theorem by Gilmore
openaire +3 more sources