ALGORITHM FOR FINDING THE COMMON SPANNING TREES OF TWO GRAPHSGRIMBLEBY JB.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 23; PP. 988-989; BIBL. 2 REF.Article

ROBUST LINEAR ALGORITHMS FOR CUTSETSROSEN BK.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 205-217; BIBL. 14 REF.Article

AN ALGORITHM FOR FINDING OPTIMUM PATH IN NETWORKSBHAT KVS.1982; J. FRANKLIN INST.; ISSN 0016-0032; USA; DA. 1982; VOL. 314; NO 5; PP. 328-332; BIBL. 5 REF.Article

ON BRACKTRACKING: A COMBINATORIAL DESCRIPTION OF THE ALGORITHM.FILLMORE JP; WILLIAMSON SG.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 1; PP. 41-55; BIBL. 3 REF.Article

DETERMINING THE NUMBER OF INTERNAL STABILITY OF A GRAPHLOUKAKIS E; TSOUROS C.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 207-220; BIBL. 23 REF.Article

A DEPTH-FIRST-SEARCH CHARACTERIZATION OF PLANARITYDE FRAYSSEIX H; ROSENSTIEHL P.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 62; PP. 75-80; BIBL. 6 REF.Conference Paper

A SIMPLE ALGORITHM FOR FINDING A CYCLE OF LENGTH GREATER THAN THREE AND WITHOUT DIAGONALSTRUSZCZYNSKI M.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 1; PP. 89-91; ABS. GER; BIBL. 5 REF.Article

LINEAR EXPECTED-TIME ALGORITHMS FOR CONNECTIVITY PROBLEMSKARP RE.1980; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1980; VOL. 1; NO 4; PP. 374-393; BIBL. 14 REF.Article

A NONLINEAR LEAST SQUARES SEARCH ALGORITHM.WOLBERG JR; ISENBERG J.1975; COMPUTER METHODS APPL. MECH. ENGNG; NETHERL.; DA. 1975; VOL. 5; NO 1; PP. 1-9; BIBL. 11 REF.Article

THERE IS NO FAST METHOD FOR FINDING MONOCHROMATIC COMPLETE SUBGRAPHSBECK J.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 1; PP. 58-64; BIBL. 3 REF.Article

AN EFFICIENT HEURISTIC FOR IDENTIFYING A MAXIMUM WEIGHT PLANAR SUBGRAPHEADES P; FOULDS L; GIFFIN J et al.1982; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1982; NO 952; PP. 239-251; BIBL. 16 REF.Conference Paper

THE CLIQUE PROBLEM FOR PLANAR GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 131-133; BIBL. 4 REF.Article

COMPLEXITY OF FINDING K-PATH-FREE DOMINATING SETS IN GRAPHSBAR YEHUDA R; VISHKIN U.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 228-232; BIBL. 8 REF.Article

NONPOLYNOMIAL AND INVERSE INTERPOLATION FOR LINE SEARCH: SYNTHESIS AND CONVERGENCE RATESBARZILAI J; BEN TAL A.1982; SIAM J. NUMER. ANAL.; ISSN 0036-1429; USA; DA. 1982; VOL. 19; NO 6; PP. 1263-1277; BIBL. 20 REF.Article

THE CONCEPT OF TWO-CHORD TIESETS AND ITS APPLICATION TO AN ALGEBRAIC CHARACTERIZATION OF NON-SERIES-PARALLEL GRAPHSSHINODA S; WAI KAI CHEN; SHU PARK CHAN et al.1982; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 4; NO 2; PP. 244-252; BIBL. 4 REF.Article

NEAR ADMISSIBLE HEURISTIC SEARCH ALGORITHMSGHALLAB M; ALLARD D.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 293-298; BIBL. 8 REF.Conference Paper

A FAST ALGORITHM FOR FINDING ALL SHORTEST PATHSWATANABE O.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 1; PP. 1-3; BIBL. 4 REF.Article

FINDING MINIMAL SPANNING TREES IN A EUCLIDEAN COORDINATE SPACENEVALAINEN O; ERNVALL J; KATAJAINEN J et al.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 1; PP. 46-54; BIBL. 16 REF.Article

OPTIMIZATION OF TURBULENCE MODELS BY MEANS OF A LOGICAL SEARCH ALGORITHMHUFFMAN GD; JONES CD; BRODKEY RS et al.1973; APPL. SCI. RES.; NETHERL.; DA. 1973; VOL. 27; NO 5; PP. 321-334; BIBL. 19 REF.Serial Issue

PARALLEL SEARCH OF STRONGLY ORDERED GAME TREESMARSLAND TA; CAMPBELL M.1982; ACM COMPUTING SURVEYS; ISSN 0360-0300; USA; DA. 1982; VOL. 14; NO 4; PP. 533-551; BIBL. 1 P.Article

A COMPARISON OF THREE ALGORITHMS FOR FINDING FUNDAMENTAL CYCLES IN A DIRECTED GRAPHRYAN DR; CHEN S.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 1-12; BIBL. 6 REF.Article

HEURISTIC SEARCH WITH PARTIAL NODE EXPANSION AND BI-DIRECTIONAL SEARCH IN PRODUCT SPACEDE CHAMPEAUX D; VAN DIJK E.1982; ECAI 82. EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE/1982-07-12/ORSAY; DEU; KAISERLAUTERN: IMPR. ABTEILUNG FOTO-REPRO-DRUCK DER UNIVERSITAET KAISERLAUTERN; DA. 1982; PP. 180-182; BIBL. 5 REF.Conference Paper

THE UTILITY OF PRECISION IN SEARCH HEURISTICSPEARL J.1982; ECAI 82. EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE/1982-07-12/ORSAY; DEU; KAISERLAUTERN: IMPR. ABTEILUNG FOTO-REPRO-DRUCK DER UNIVERSITAET KAISERLAUTERN; DA. 1982; PP. 177-179; BIBL. 10 REF.Conference Paper

OPTIMAL ASSOCIATIVE SEARCHING ON A CELLULAR COMPUTERSTANAT DF; WILLIAMS EH JR.1981; CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE/1981/PORTSMOUTH NH; USA; NEW YORK: ACM; DA. 1981; PP. 99-106; BIBL. 13 REF.Conference Paper

SUR L'ALGORITHME "GAUCHE-DROITE" DE PLANEARITE DES GRAPHES, DE MM. H. DE FRAYSSEIX ET P. ROSENSTIEHL = ON H. DE FRAYSSEIX ET P. ROSENSTIEHL'S "LEFT-RIGHT" PLANARITY ALGORITHM OF GRAPHSRICHARD JEAN PHILIPPE.1982; ; FRA; DA. 1982; 134 P.; 30 CM; BIBL. 3 P.; TH. 3E CYCLE: MATH./PARIS 6/1982Thesis