Results 1 
7 of
7
Complexity and Algorithms for Reasoning About Time: A GraphTheoretic Approach
, 1992
"... Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence ..."
Abstract

Cited by 86 (11 self)
 Add to MetaCart
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimal labeling, all solutions and all realizations problems are considered for temporal (interval) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NPcomplete. On the positive side, we give efficient algorithms for several restrictions of the problem. In the process, the interval graph sandwich problem is introduced, and is shown to be NPcomplete. This problem is als...
Degrees of freedom versus dimension for containment orders, Order 5
 Order
, 1988
"... Given a family of sets S, where the sets in S admit k ‘degrees of freedom’, we prove that not all (k + 1)dimensional posets are containment posets of sets in S. Our results depend on the following enumerative result of independent interest: Let P (n, k) denote the number of partially ordered sets o ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Given a family of sets S, where the sets in S admit k ‘degrees of freedom’, we prove that not all (k + 1)dimensional posets are containment posets of sets in S. Our results depend on the following enumerative result of independent interest: Let P (n, k) denote the number of partially ordered sets on n labeled elements of dimension k. We show that log P (n, k) ∼ nk log n where k is fixed and n is large. KEY WORDS: partially ordered set, containment order, degrees of freedom, partial order dimension AMS SUBJECT CLASSIFICATION: 06A10 (primary), 14N10 (secondary) 1.
Factorisations and characterisations of inducedhereditary and compositive properties, in preparation. Cit
"... A graph property (i.e., a set of graphs) is inducedhereditary or additive if it is closed under taking inducedsubgraphs or disjoint unions. If P and Q are properties, the product P ◦ Q consists of all graphs G for which there is a partition of the vertex set of G into (possibly empty) subsets A an ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A graph property (i.e., a set of graphs) is inducedhereditary or additive if it is closed under taking inducedsubgraphs or disjoint unions. If P and Q are properties, the product P ◦ Q consists of all graphs G for which there is a partition of the vertex set of G into (possibly empty) subsets A and B with G[A] ∈ P and G[B] ∈ Q. A property is ∗ The results presented here are part of the first author’s Ph.D. thesis, written under the supervision of the second author. Jim Geelen suggested one of the main results of this paper. † The first author’s doctoral studies in Canada were fully funded by the Canadian government through a Canadian Commonwealth Scholarship. ‡ Research supported by NSERC.
Subtree Overlap Graphs and the Maximum Independent Set Problem
, 1998
"... A graph G is a subtree overlap graph if there exists a tree T and a set of subtrees fT i g so that there exists a onetoone mapping between vertices and subtrees and two subtrees overlap if and only if their respective vertices are adjacent. The class of subtree overlap graphs is proven to contain ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A graph G is a subtree overlap graph if there exists a tree T and a set of subtrees fT i g so that there exists a onetoone mapping between vertices and subtrees and two subtrees overlap if and only if their respective vertices are adjacent. The class of subtree overlap graphs is proven to contain the classes of circle, spider or circle polygon, and chordal graphs. An upper bound on the size of the subtree overlap model is proven to be 3m. As well a general algorithm to find the maximum independent set for any class of overlap graph is given, provided testing for containment and intersection in the overlap graph can be done in polynomial time, and the maximumweight independent set problem is solved for the related class of intersection graph. The complexities of the Hamiltonian Cycle, several domination problems, isomorphism and colouring are shown to be as hard for subtree overlap graphs as they are for graphs in general. Acknowledgements Many people have helped me with this thesi...
Representing Digraphs Using Intervals Or Circular Arcs
"... Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circulararc containment digraphs are the complements of circulararc intersection digraphs. A poset is an interval containm ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circulararc containment digraphs are the complements of circulararc intersection digraphs. A poset is an interval containment poset if and only if its comparability digraph is an interval containment digraph, and a graph is an interval graph if and only if the corresponding symmetric digraph with loops is an interval digraph. In an appropriate model of overlap representation using intervals, the unit rightoverlap interval digraphs are precisely the unit interval digraphs, and the adjacency matrices of rightoverlap interval digraphs have a simple structural characterization bounding their Ferrers dimension by 3. Keywords: digraph, intersection representation, containment, overlap, unit interval, Ferrers dimension Running head: REPRESENTATIONS OF DIGRAPHS y Research supported in part by NSA/MSP Grant MDA9049...
Permutation Bigraphs: An Analogue of Permutation Graphs
, 2011
"... We introduce the class of permutation bigraphs as an analogue of permutation graphs. We show that this is precisely the class of bigraphs having Ferrers dimension at most 2. We also characterize the subclasses of interval bigraphs and indifference bigraphs in terms of their permutation labelings, an ..."
Abstract
 Add to MetaCart
We introduce the class of permutation bigraphs as an analogue of permutation graphs. We show that this is precisely the class of bigraphs having Ferrers dimension at most 2. We also characterize the subclasses of interval bigraphs and indifference bigraphs in terms of their permutation labelings, and we relate permutation bigraphs to posets of dimension 2.