#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1967

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Key Phrases

#### Organism

Learn More

- Derek G. Corneil, H. Lerchs, L. Stewart Burlingham
- Discrete Applied Mathematics
- 1981

- Natasa Przulj, Derek G. Corneil, Igor Jurisica
- Bioinformatics
- 2004

MOTIVATION
Networks have been used to model many real-world phenomena to better understand the phenomena and to guide experiments in order to predict their behavior. Since incorrect models lead to incorrect predictions, it is vital to have as accurate a model as possible. As a result, new techniques and models for analyzing and modeling real-world networks… (More)

- Derek G. Corneil, Udi Rotics
- SIAM J. Comput.
- 2001

- Leizhen Cai, Derek G. Corneil
- SIAM J. Discrete Math.
- 1995

A tree t-spanner T of a graph G is a spanning tree in which the distance between every pair of vertices is at most t times their distance in G. This notion is motivated by applications in communication networks, distributed systems, and network design. This paper studies graph theoretic, algorithmic and complexity issues about tree spanners. It is shown… (More)

- Derek G. Corneil, Yehoshua Perl, Lorna Stewart
- SIAM J. Comput.
- 1985

An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common… (More)

- Derek G. Corneil, Yehoshua Perl
- Discrete Applied Mathematics
- 1984

- Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
- Inf. Process. Lett.
- 1995

We present a linear time algorithm for unit interval graph recognition. The algorithm is simple and based on Breadth-First Search. It is also direct | it does not rst recognize the graph as an interval graph. Given a graph G, the algorithm produces an ordering of the vertices of the graph whenever G is a unit interval graph. This order corresponds to the… (More)

- Derek G. Corneil
- Discrete Applied Mathematics
- 2004

We present a simple linear time algorithm for unit interval graph recognition. This algorithm uses 3 LBFS sweeps and then a very simple test to determine if the given graph is a unit interval graph. It is argued that this algorithm is the most easily implementable unit interval graph recognition algorithm known.

- Derek G. Corneil, Richard Krueger
- SIAM J. Discrete Math.
- 2008