D
Derek G. Corneil
Researcher at University of Toronto
Publications - 123
Citations - 8854
Derek G. Corneil is an academic researcher from University of Toronto. The author has contributed to research in topics: Chordal graph & Indifference graph. The author has an hindex of 41, co-authored 123 publications receiving 8351 citations. Previous affiliations of Derek G. Corneil include Artemis & University of Alberta.
Papers
More filters
Journal ArticleDOI
Complexity of finding embeddings in a k -tree
TL;DR: This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
Journal ArticleDOI
Complement reducible graphs
TL;DR: It is shown that this family of graphs can be uniquely represented by a tree where the leaves of the tree correspond to the vertices of the graph.
Journal ArticleDOI
Modeling interactome: scale-free or geometric?
TL;DR: It is shown that the structure of PPI networks is better modeled by a geometric random graph than by a scale-free model, and a random geometric model provides a much more accurate model of the PPI data.
Journal ArticleDOI
A linear recognition algorithm for cographs
TL;DR: This paper presents a linear time algorithm for recognizing cographs and constructing their cotree representation, which is possible to design very fast polynomial time algorithms for problems which are intractable for graphs in general.
Journal ArticleDOI
The graph isomorphism disease
Ronald C. Read,Derek G. Corneil +1 more
TL;DR: The present state of the art of isomorphism testing is surveyed, its relationship to NP-completeness is discussed, and some of the difficulties inherent in this particularly elusive and challenging problem are indicated.