Results 281 to 290 of about 586,356 (320)
Meteorological drivers of hemorrhagic fever with renal syndrome in China's Jiaodong Peninsula: an ecological time-series study from 2020 to 2024. [PDF]
Guo X +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
Journal of Combinatorial Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Li, Wang, Chi, Zhang, Peisen
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Li, Wang, Chi, Zhang, Peisen
openaire +2 more sources
Recognizing d-Interval Graphs and d-Track Interval Graphs
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
ACM Transactions on Algorithms, 2012
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
Characterizing interval graphs which are probe unit interval graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2002
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source

