E-LIB Suche - Ergebnisse für: Corneil, D.G.

1

Efficient estimation of graphlet frequency distributions in..:

Pržulj, N. ; Corneil, D. G. ; Jurisica, I.
Bioinformatics. 22 (2006) 8 - p. 974-980 , 2006

Link: https://doi.org/10.1093/..

2

Modeling interactome: scale-free or geometric?:

Pržulj, N. ; Corneil, D. G. ; Jurisica, I.
Bioinformatics. 20 (2004) 18 - p. 3508-3515 , 2004

Link: https://doi.org/10.1093/..

3

The existence of uniquely −G colourable graphs:

Achlioptas, D. ; Brown, J.I. ; Corneil, D.G..
Discrete Mathematics. 179 (1998) 1-3 - p. 1-11 , 1998

Link: https://doi.org/10.1016/..

4

On the structure of trapezoid graphs:

Cheah, F. ; Corneil, D.G.
Discrete Applied Mathematics. 66 (1996) 2 - p. 109-133 , 1996

Link: https://doi.org/10.1016/..

5

Stable Set Bonding in Perfect Graphs and Parity Graphs:

Corneil, D.G. ; Fonlupt, J.
Journal of Combinatorial Theory, Series B. 59 (1993) 1 - p. 1-14 , 1993

Link: https://doi.org/10.1006/..

6

On the complexity of the embedding problem for hypercube re..:

Wagner, A. ; Corneil, D.G.
Discrete Applied Mathematics. 43 (1993) 1 - p. 75-95 , 1993

Link: https://doi.org/10.1016/..

7

Parallel algorithms for parity graphs:

Przytycka, T ; Corneil, D.G
Journal of Algorithms. 12 (1991) 1 - p. 96-109 , 1991

Link: https://doi.org/10.1016/..

8

Addendum:

Cheah, F. ; Corneil, D.G.
Discrete Applied Mathematics. 31 (1991) 3 - p. 309 , 1991

Link: https://doi.org/10.1016/..

9

Embedding Trees in a Hypercube is NP-Complete:

Wagner, A. ; Corneil, D. G.
SIAM Journal on Computing. 19 (1990) 3 - p. 570-590 , 1990

Link: https://doi.org/10.1137/..

10

The complexity of regular subgraph recognition:

Cheah, F. ; Corneil, D.G.
Discrete Applied Mathematics. 27 (1990) 1-2 - p. 59-68 , 1990

Link: https://doi.org/10.1016/..

11

Recognizing visibility graphs of spiral polygons:

Everett, H ; Corneil, D.G
Journal of Algorithms. 11 (1990) 1 - p. 1-26 , 1990

Link: https://doi.org/10.1016/..

12

The complexity of generalized clique covering:

Corneil, D.G. ; Fonlupt, J.
Discrete Applied Mathematics. 22 (1988) 2 - p. 109-118 , 1988

Link: https://doi.org/10.1016/..

13

A Dynamic Programming Approach to the Dominating Set Proble..:

Corneil, D. G. ; Keil, J. M.
SIAM Journal on Algebraic Discrete Methods. 8 (1987) 4 - p. 535-543 , 1987

Link: https://doi.org/10.1137/..

14

Families of graphs complete for the strong perfect graph Co..:

Corneil, D. G.
Journal of Graph Theory. 10 (1986) 1 - p. 33-40 , 1986

Link: https://doi.org/10.1002/..

15

The complexity of generalized clique packing:

Corneil, D.G.
Discrete Applied Mathematics. 12 (1985) 3 - p. 233-239 , 1985

Link: https://doi.org/10.1016/..