Interval graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Seven intervals on the real line and the corresponding seven-vertex interval graph.

In graph theory, an interval graph is the intersection graph of a family of intervals on the real line. It has one vertex for each interval in the family, and an edge between every pair of vertices corresponding to intervals that intersect.

Definition[edit]

Formally, an interval graph is an undirected graph formed from a family of intervals

Si, i = 0, 1, 2, ...

by creating one vertex vi for each interval Si, and connecting two vertices vi and vj by an edge whenever the corresponding two sets have a nonempty intersection, that is,

E(G) = {{vivj} | Si ∩ Sj ≠ ∅}.

From this construction one can verify a common property held by all interval graphs. That is, graph G is an interval graph if and only if the maximal cliques of G can be ordered M1M2, ..., Mk such that for any v ∈ Mi ∩ Mk, where i < k, it is also the case that v ∈ Mj for any Mj, i ≤ j ≤ k.[1]

Characterizations[edit]

Three vertices form an asteroidal triple in a graph G if, for each two, there exists a path containing those two but no neighbor of the third. A graph is AT-free if it has no asteroidal triple. The earliest characterization of interval graphs seems to be the following:

A graph is an interval graph if and only if it is chordal and AT-free.[2]

Other characterizations:

A graph is an interval graph if and only if the edge clique cover of all of its maximal cliques can be arranged into a clique path representation. [3]

A graph is an interval graph if and only if it is C4-free and its complement has a transitive orientation.[4]

Various other characterizations of interval graphs and variants are mentioned in,.[5][6]

Efficient recognition algorithms[edit]

Determining whether a given graph G = (V, E) is an interval graph can be done in O(|V|+|E|) time by seeking an ordering of the maximal cliques of G that is consecutive with respect to vertex inclusion.[citation needed]

The original linear time recognition algorithm of Booth & Lueker (1976) is based on their complex PQ tree data structure, but Habib et al. (2000) showed how to solve the problem more simply using lexicographic breadth-first search, based on the fact that a graph is an interval graph if and only if it is chordal and its complement is a comparability graph.[1][7] A similar approach using a 6-sweep LexBFS algorithm is described in Corneil, Olariu & Stewart (2009).

Related families of graphs[edit]

By the characterization of interval graphs as AT-free chordal graphs,[2] interval graphs are strongly chordal graphs and hence perfect graphs. Their complements belong to the class of comparability graphs,[4] and the comparability relations are precisely the interval orders.[1]

Based on the fact that a graph is an interval graph if and only if it is chordal and its complement is a comparability graph, we have: A graph and its complement are interval graphs if and only if it is both a split graph and a permutation graph.

The interval graphs that have an interval representation in which every two intervals are either disjoint or nested are the trivially perfect graphs.

A graph has boxicity at most one if and only if it is an interval graph; the boxicity of an arbitrary graph G is the minimum number of interval graphs on the same set of vertices such that the intersection of the edges sets of the interval graphs is G.

The intersection graphs of arcs of a circle form circular-arc graphs, a class of graphs that contains the interval graphs. The trapezoid graphs, intersections of trapezoids whose parallel sides all lie on the same two parallel lines, are also a generalization of the interval graphs.

The connected triangle-free interval graphs are exactly the caterpillar trees.[8]

Proper Interval Graphs[edit]

Proper interval graphs are interval graphs that have an interval representation in which no interval properly contains any other interval; unit interval graphs are the interval graphs that have an interval representation in which each interval has unit length. A unit interval representation without repeated intervals is necessarily a proper interval representation. Not every proper interval representation is a unit interval representation, but every proper interval graph is a unit interval graph, and vice versa.[9] Every proper interval graph is a claw-free graph; conversely, the proper interval graphs are exactly the claw-free interval graphs. However, there exist claw-free graphs that are not interval graphs.[10]

An interval graph is called q-proper if there is a representation in which no interval is contained by more than q others. This notion extends the idea of proper interval graphs such that a 0-proper interval graph is a proper interval graph.[11]

Improper Interval Graphs[edit]

An interval graph is called p-improper if there is a representation in which no interval contains more than p others. This notion extends the idea of proper interval graphs such that a 0-improper interval graph is a proper interval graph.[12]

K-nested Interval Graphs[edit]

An interval graph is k-nested if there is no chain of length k+1 of intervals nested in each other. This is a generalization of proper interval graphs as 1-nested interval graphs are exactly proper interval graphs.[13]

Applications[edit]

The mathematical theory of interval graphs was developed with a view towards applications by researchers at the RAND Corporation's mathematics department, which included young researchers—such as Peter C. Fishburn and students like Alan C. Tucker and Joel E. Cohen—besides leaders—such as Delbert Fulkerson and (recurring visitor) Victor Klee.[14] Cohen applied interval graphs to mathematical models of population biology, specifically food webs.[15]

Interval graphs are used to represent resource allocation problems in operations research and scheduling theory. In these applications, each interval represents a request for a resource (such as a processing unit of a distributed computing system or a room for a class) for a specific period of time. The maximum weight independent set problem for the graph represents the problem of finding the best subset of requests that can be satisfied without conflicts.[16] An optimal graph coloring of the interval graph represents an assignment of resources that covers all of the requests with as few resources as possible; it can be found in polynomial time by a greedy coloring algorithm that colors the intervals in sorted order by their left endpoints.[17]

Other applications include genetics, bioinformatics, and computer science. Finding a set of intervals that represent an interval graph can also be used as a way of assembling contiguous subsequences in DNA mapping.[18] A Interval graphs also play an important role in temporal reasoning.[19]

Interval completions and pathwidth[edit]

If G is an arbitrary graph, an interval completion of G is an interval graph on the same vertex set that contains G as a subgraph. The parameterized version of interval completion (find an interval supergraph with k additional edges) is fixed parameter tractable, and moreover, is solvable in parameterized subexponential time.[20][21]

The pathwidth of an interval graph is one less than the size of its maximum clique (or equivalently, one less than its chromatic number), and the pathwidth of any graph G is the same as the smallest pathwidth of an interval graph that contains G as a subgraph.[22]

Notes[edit]

  1. ^ a b c (Fishburn 1985)
  2. ^ a b Lekkerkerker & Boland (1962)
  3. ^ Fulkerson & Gross (1965)
  4. ^ a b Gilmore & Hoffman (1964)
  5. ^ McKee & McMorris (1999)
  6. ^ Brandstädt, Le & Spinrad (1999)
  7. ^ Golumbic (1980).
  8. ^ Eckhoff (1993).
  9. ^ Roberts (1969); Gardi (2007)
  10. ^ Faudree, Flandrin & Ryjáček (1997), p. 89.
  11. ^ Proskurowski, Andrzej; Telle, Jan Arne (1999). "Classes of graphs with restricted interval models". Discrete Mathematics & Theoretical Computer Science. 3 (4): 167–176. CiteSeerX 10.1.1.39.9532Freely accessible. 
  12. ^ Beyerl, Jeffrey; Jamison, Robert (2008). "Interval graphs with containment restrictions". Congressus Numerantium. 191 (2008): 117–128. arXiv:1109.6675Freely accessible [math.CO]. Bibcode:2011arXiv1109.6675B. 
  13. ^ Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří (2015-10-14). "On the Classes of Interval Graphs of Limited Nesting and Count of Lengths". arXiv:1510.03998Freely accessible [cs.DM]. 
  14. ^ Cohen (1978, pp. ix-10)
  15. ^ Cohen (1978, pp. 12–33)
  16. ^ Bar-Noy et al. (2001).
  17. ^ Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7. 
  18. ^ Zhang et al. (1994).
  19. ^ Golumbic & Shamir (1993).
  20. ^ Villanger et al. (2009).
  21. ^ Bliznets et al. (2014).
  22. ^ Bodlaender (1998).

References[edit]

External links[edit]