CONNECTIVITY AND EDGE-DISJOINT SPANNING TREESGUSFIELD D.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 87-89; BIBL. 7 REF.Article

MATCHING AND SPANNING IN CERTAIN PLANAR GRAPHSCARLYLE JW; GREIBACH SA; PAZ A et al.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 2; PP. 159-183; BIBL. 17 REF.Article

ON THE COMPLEXICITY OF FINDING MULTI-CONSTRAINED SPANNING TREESCAMERINI PM; GALBIATI G; MAFFIOLI F et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 39-50; BIBL. 5 REF.Conference Paper

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

ENUMERATION OF SAPANNING TREES CONTAINING GIVEN SUBTREES.OLAH G.1975; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1975; VOL. 26; NO 1-2; PP. 205-207; BIBL. 11 REF.Article

ON ENUMERATING THE TREES OF THE WHEEL AND OTHER SPECIAL GRAPHSJOHNSON DE; JOHNSON JR.1983; JOURNAL OF THE FRANKLIN INSTITUTE; ISSN 0016-0032; USA; DA. 1983; VOL. 315; NO 2; PP. 139-148; BIBL. 7 REF.Article

ON FINDING AND UPDATING SPANNING TREES AND SHORTEST PATHS.SPIRA PM; PAN A.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 375-380; BIBL. 6 REF.Article

A PROBLEM ON SPANNING TREES.TUTTE WT.1974; QUART. J. MATH.; G.B.; DA. 1974; VOL. 25; NO 98; PP. 253-255; BIBL. 2 REF.Article

EFFICIENT ALGORITHMS FOR DETERMINING AN EXTREMAL TREE OF A GRAPH. (EXTENDED ABSTRACT.).KAMEDA T; TOIDA S.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 12-15; BIBL. 8 REF.Conference Paper

ON FINDING AND UPDATING SHORTEST PATHS AND SPANNING TREES.SPIRA PM; PAN A.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 82-84; BIBL. 5 REF.Conference Paper

ON THE WORST CASE OF A MINIMAL SPANNING TREE ALGORITHM FOR EUCLIDEAN SPACEKATAJAINEN J.1983; BIT (NORDISK TIDSKRIFT FOR INFORMATIONSBEHANDLING); ISSN 0006-3835; SWE; DA. 1983; VOL. 23; NO 1; PP. 2-8; BIBL. 3 REF.Article

ON SPANNING TREES, WEIGHTED COMPOSITIONS, FIBONACCI NUMBERS, AND RESISTOR NETWORKS.MYERS BR.1975; S.I.A.M. REV.; U.S.A.; DA. 1975; VOL. 17; NO 3; PP. 465-474; BIBL. 4 REF.Article

PRIORITY QUEUES WITH UPDATE AND FINDING MINIMUM SPANNING TREES.JOHNSON DB.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 3; PP. 53-57; BIBL. 10 REF.Article

FINDING MINIMUM SPANNING TREES WITH A FIXED NUMBER OF LINKS AT A NODE.GLOVER F; KLINGMAN D.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 191-201; BIBL. 1 P.Conference Paper

AN ALGORITHM FOR DETERMINING THE TOPOLOGICAL DIMENSIONALITY OF POINT CLUSTERS.SCHWARTZMANN DH; VIDAL JJ.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 12; PP. 1175-1182; BIBL. 19 REF.Article

AN INFORMATION MEASURE FOR SINGLE LINK CLASSIFICATION.BOULTON DM; WALLACE CS.1975; COMPUTER J.; G.B.; DA. 1975; VOL. 18; NO 3; PP. 236-238; BIBL. 8 REF.Article

THE FIBONACCI NUMBERS VIA TRIGONOMETRIC EXPRESSIONS.BEDROSIAN SD.1973; J. FRANKLIN INST.; U.S.A.; DA. 1973; VOL. 295; NO 2; PP. 175-177; BIBL. 7 REF.Article

GRAPHS WITH CERTAINS FAMILIES OF SPANNING TREESERDOS P; FAUDREE RJ; ROUSSEAU CC et al.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 162-170; BIBL. 7 REF.Article

ALGORITHM 491. BASIC CYCLE GENERATION (H).GIBBS NE.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 5; PP. 275-276; BIBL. 1 REF.Article

HARDWARE APPROACH FOR GENERATING SPANNING TREES IN RELIABILITY STUDIESBANSAL VK; MISRA KB.1981; MICROELECTRON. RELIAB.; ISSN 0026-2714; GBR; DA. 1981; VOL. 21; NO 2; PP. 243-253; BIBL. 4 REF.Article

TRANSITIVITY SETS (G7).MCKAY J; REGENER E.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 8; PP. 470Article

UEBER DIE BESTIMMUNG MINIMALER WEGE UND GERUESTE IN GRAPHEN. = SUR LA DETERMINATION DES CHEMINS MINIMAUX ET DES ARBRES MAXIMAUX DANS LES GRAPHESJUNG HA.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 13; NO 3-4; PP. 249-252; ABS. ANGL.; BIBL. 5 REF.Article

STOCHASTIC SPANNING TREE PROBLEMISHII H; SHIODE S; NISHIDA T et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 263-273; BIBL. 8 REF.Article

ENUMERATION DES ARBRES MAXIMAUX D'UNE CLASSE DE GRAPHES BIPARTISKONONENKO AM; TRUKHANOVSKIJ NN.1978; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; BYS; DA. 1978; NO 6; PP. 111-113; ABS. ENG; BIBL. 4 REF.Article

MINIMUM COST SPANNING TREE GAMESGRANOT D; HUBERMAN G.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 1; PP. 1-18; BIBL. 10 REF.Article