Abstract | ||
---|---|---|
In this paper we survey two kinds of generalizations of the ideas of interval graphs and interval orders. For the first generalization we use intervals in ordered sets more general than the real numbers. For the second generalization, we restrict ourselves to intervals chosen in the real numbers, but we define two vertices to be adjacent (in the graphs) or incomparable (in the orders) only when the intervals overlap by more than a specified amount. Each of these generalizations suggests new avenues for research. |
Year | DOI | Venue |
---|---|---|
1994 | 10.1007/BFb0019424 | ORDAL |
Keywords | Field | DocType |
interval orders,interval order,interval graph | Ordered set,Graph,Combinatorics,Interval order,Vertex (geometry),Generalization,Real number,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-58274-6 | 4 | 0.68 |
References | Authors | |
4 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kenneth P. Bogart | 1 | 162 | 46.13 |