Results 1  10
of
1,879
AND INTERVAL GRAPHS
, 1964
"... Approved for public release; distribution is unlimited. Distribution authorized to U.S. Gov't. agencies and their contractors; ..."
Abstract
 Add to MetaCart
Approved for public release; distribution is unlimited. Distribution authorized to U.S. Gov't. agencies and their contractors;
Counting interval graphs
 Trans. Amer. Math. Soc
, 1982
"... ABSTRACT. In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The enumeration makes use of a structural decomposition of interval graphs which leads to a ch ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
ABSTRACT. In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The enumeration makes use of a structural decomposition of interval graphs which leads to a
On Probe Interval Graphs
, 2001
"... In this report, we first studied the characteristics of probe interval graphs. Then we analyzed an O(n³) algorithm, which recongnizes probe interval graphs and gives a possible solution. In addition, the algorithm was illustrated by two examples step by step. Based on our analysis, we provided a des ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
In this report, we first studied the characteristics of probe interval graphs. Then we analyzed an O(n³) algorithm, which recongnizes probe interval graphs and gives a possible solution. In addition, the algorithm was illustrated by two examples step by step. Based on our analysis, we provided a
On homogeneously representable interval graphs
"... We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneously representable interval graphs. ..."
Abstract
 Add to MetaCart
We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneously representable interval graphs.
Interval graph limits
, 2011
"... We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the c ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution
Characterizations of probe interval graphs
, 2008
"... In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every probe ..."
Abstract
 Add to MetaCart
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every
Tagged Probe Interval Graphs
, 1998
"... A generalization of interval graph is introduced for cosmid contig mapping of DNA. A graph is a tagged probe interval graph if its vertex set can be partitioned into two subsets of probes and nonprobes, and a closed interval can be assigned to each vertex such that two vertices are adjacent if and o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A generalization of interval graph is introduced for cosmid contig mapping of DNA. A graph is a tagged probe interval graph if its vertex set can be partitioned into two subsets of probes and nonprobes, and a closed interval can be assigned to each vertex such that two vertices are adjacent
kGap interval graphs
 IN: PROC. OF THE 10TH LATIN AMERICAN THEORETICAL INFORMATICS SYMPOSIUM (LATIN) (2012). AVAILABLE AT: ARXIV:1112.3244
, 2012
"... We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersectio ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty
Multitrack Interval Graphs
, 1995
"... . A dtrack interval is a union of d intervals, one each from d parallel lines. The intersection graphs of dtrack intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G. The trac ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
. A dtrack interval is a union of d intervals, one each from d parallel lines. The intersection graphs of dtrack intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G
Shiftable Interval Graphs
"... Abstract: A Shiftable Interval Graph (SIG) is defined by a set of intervals and a set of windows associated with the intervals. Each interval does not have a fixed position, but it is allowed to move, provided that it remains completely contained into its window. Once a position has been fixed for a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: A Shiftable Interval Graph (SIG) is defined by a set of intervals and a set of windows associated with the intervals. Each interval does not have a fixed position, but it is allowed to move, provided that it remains completely contained into its window. Once a position has been fixed
Results 1  10
of
1,879