Results 301 to 310 of about 3,671,469 (355)
Some of the next articles are maybe not open access.
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
Journal of Graph Theory, 1993
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
2001
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
openaire +1 more source
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
openaire +1 more source
Random Structures and Algorithms, 1998
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
Multimedia tools and applications, 2020
V. S. Avani, S. Shaila, A. Vadivel
semanticscholar +1 more source
V. S. Avani, S. Shaila, A. Vadivel
semanticscholar +1 more source
Combinatorica, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources