D.G. CORNEIL, Y. PERL, L.K. STEWART, A linear recognition algorithm for cographs, Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Hans L. Bodlaender - Andreas Brandst Adt (2003) (Correct)
No context found.
D.G. CORNEIL, Y. PERL, L.K. STEWART, A linear recognition algorithm for cographs,
Hans L. Bodlaender and Thomas Wolle - Institute Of Information (2004) (Correct)
No context found.
D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14:926--934, 1985.
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch (Correct)
No context found.
D. G Corneil, Y. Perl, and L. K. Stewart, A linear recognition algorithm for cographs, SIAM Journal on Computing, 3 (1985), pp. 926--934.
Factoring and Recognition of Read-Once Functions Using.. - Golumbic, Mintz, Rotics (2004) (Correct)
No context found.
D. Corneil, Y. Perl, and L. Stewart. A linear recognition algorithm for cographs. SIAM Journal of Computing, 14:926--934, November 1985.
New Graph Classes of Bounded Clique-Width - Brandstädt, Dragan, Le, Mosca (2003) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
Contraction Degeneracy on Cographs - Bodlaender, Wolle (2004) (Correct)
No context found.
D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14:926--934, 1985.
Deciding Clique-Width for Graphs of Bounded Tree-Width - Espelage, Gurski, Wanke (2003) (Correct)
No context found.
D.G. Corneil, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926--934, 1985.
Automated Generation of Search Tree Algorithms for.. - Gramm, Guo.. (2004) (2 citations) (Correct)
No context found.
D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926--934, 1985.
Graph Modification Problems and Automated Search Tree Generation - Hüffner (2003) (Correct)
No context found.
Derek G. Corneil, Yehoshua Perl, and Lorna K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926--934, 1985. 60
Chordal co-gem-free and (P_5,gem)-free graphs have bounded .. - Brandstädt, Le, Mosca (2002) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
A Simple Linear Time Algorithm for Cograph Recognition - Habib, Paul (2001) (Correct)
No context found.
D.G. Corneil, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal of Computing, 14(4):926934, Novenber 1985.
New Graph Classes of Bounded Clique-Width - Brandstädt, Dragan, Le, Mosca (2002) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
No context found.
D. G. Corneil, Y. Pearl and L. Stewart, A linear recognition algorithm for cograph, SIAM J. Comput. 14 (1985), 926-934.
New Graph Classes of Bounded Clique-Width II - Brandstädt, al. (2003) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004) (Correct)
No context found.
D. G. Corneil, Y. Perl and L. K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985), 926--934.
On the Structure and Stability Number of P_5- and.. - Brandstädt, Mosca (2002) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
Graph Subcolorings: Complexity and Algorithms - Ji Fiala Klaus (2 citations) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985), 926-934
Counting Spanning Trees in Cographs - Nikolopoulos, Papadopoulos (Correct)
No context found.
D. G. Corneil, Y. Perl, and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14, 926-984, 1985.
Graph Subcolorings: Complexity and Algorithms - Fiala, Jansen, Le, Seidel (2002) (2 citations) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
Efficient Robust Algorithms for the Maximum Weight.. - Brandstädt, Le, de.. (2003) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
Recognizing Bipolarizable and P_4-simplicial Graphs - Nikolopoulos, Palios (Correct)
No context found.
D.G. Corneil, Y. Perl, and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14, 926-934, 1985.
Parallel Algorithms for Hamiltonian Problems on.. - Nikolopoulos (Correct)
No context found.
D.G. Corneil, Y. Perl and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
On the Structure of (P_5,Gem)-Free Graphs - Brandstädt, Kratsch (2002) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
On Variations of P_4-Sparse Graphs - Brandstädt, Mosca (2002) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934 10
Recognizing Cographs And Threshold Graphs Through A.. - Nikolopoulos (2000) (Correct)
No context found.
D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926--934.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC