AN ALGORITHM FOR DETERMINING THE AUTOMORPHISM PARTITIONING OF AN UNDIRECTED GRAPHCORNEIL DG.1972; B.I.T.; DANM.; DA. 1972; VOL. 12; NO 2; PP. 161-171; BIBL. 7 REF.Serial Issue

WEIGHTED ISOMORPHISM PROBLEMSCORNEIL DG; KRISHNAMOORTHY MS.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 213-220; BIBL. 10 REF.Conference Paper

A COMPARISON AND EVALUATION OF GRAPH THEORETICAL CLUSTERING TECHNIQUES.CORNEIL DG; WOODWARD ME.1978; INFOR; CANADA; DA. 1978; VOL. 16; NO 1; PP. 74-89; ABS. FR.; BIBL. 23 REF.Article

PARALLEL COMPUTATIONS IN GRAPH THEORY.ESHRAT ARJOMANDI; CORNEIL DG.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 13-18; BIBL. 11 REF.Conference Paper

FOREST EMBEDDINGS IN REGULAR GRAPHS OF LARGE GIRTHKIRKPATRICK DG; CORNEIL DG.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 1; PP. 45-60; BIBL. 4 REF.Article

A THEORETICAL ANALYSIS OF VARIOUS HEURISTICS FOR THE GRAPH ISOMORPHISM PROBLEMCORNEIL DG; KIRKPATRICK DG.1980; S.I.A.M.J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 281-297; BIBL. 43 REF.Article

ON DECIDING SWITCHING EQUIVALENCE OF GRAPHSCOLBOURN CJ; CORNEIL DG.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 3; PP. 181-184; BIBL. 10 REF.Article

ISOMORPHISM TESTING IN HOOKUP CLASSESKLAWE MM; CORNEIL DG; PROSKUROWSKI A et al.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 2; PP. 260-274; BIBL. 17 REF.Article

COMPLEMENT REDUCIBLE GRAPHSCORNEIL DG; LERCHS H; BURLINGHAM LS et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 3; PP. 163-174; BIBL. 26 REF.Article

MINIMAL EVENT-NODE NETWORK OF PROJECT PRECEDENCE RELATIONSCORNEIL DG; GOTLIEB CC; LEE YM et al.1973; COMMUNIC. A.C.M.; U.S.A.; DA. 1973; VOL. 16; NO 5; PP. 296-298; BIBL. 5 REF.Serial Issue