A DECOMPOSITION PROPERTY OF BASIC ACYCLIC GRAPHS.EFTIMIE M; EFTIMIE R.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 17; NO 3; PP. 271-279; BIBL. 5 REF.Article

EXTENDING THE GREENE-KLEITMAN THEOREM TO DIRECTED GRAPHSLINIAL N.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 3; PP. 331-334; BIBL. 7 REF.Article

A FAMILY OF GRAPHS WITH EXPENSIVE DEPTH-REDUCTIONSCHNITGER G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 91-97; BIBL. 3 REF.Conference Paper

SOME RELIABILITY ROUTING PROBLEMS IN AN ACYCLIC DIRECTED NETWORK WITH STOCHASTIC TERMINAL NODEKUMAR S.1982; MICROELECTRON. RELIAB.; ISSN 0026-2714; GBR; DA. 1982; VOL. 22; NO 1; PP. 31-41; BIBL. 12 REF.Article

THE JUMP NUMBER OF DAGS AND POSETS: AN INTRODUCTIONCHEIN M; HABIB M.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 189-194; BIBL. 11 REF.Article

GRAPH GRAMMARS AND THE COMPLEXITY GAP IN THE ISOMORPHISM PROBLEM FOR ACYCLIC DIGRAPHSSCHNITZLER M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 137-149; BIBL. 11 REF.Conference Paper

COMPLETEMENT HAMILTONIEN DE QUELQUES CLASSES DE GRAPHESKORNIENKO NM.1982; VESCI AKAD. NAVUK BSSR, SER. FIZ.-MAT. NAVUK; ISSN 0002-3574; BYS; DA. 1982; NO 4; PP. 18-22; ABS. ENG; BIBL. 4 REF.Article

A UNIFIED FORMULA FOR ANALYSIS OF SOME NETWORK RELIABILITY PROBLEMS = UNE FORMULE UNIFIEE POUR L'ANALYSE DE QUELQUES PROBLEMES DE FIABILITE DE RESEAUSATYANARAYANA A.1982; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1982; VOL. 31; NO 1; PP. 23-32; BIBL. 11 REF.Article

QUELQUES PROPRIETES DES GRAPHES EN SERIE-PARALLELEGORDON VS.1981; VESCI AKAD. NAVUK BSSR, SER. FIZ.-MAT. NAVUK; ISSN 0002-3574; BYS; DA. 1981; NO 1; PP. 18-23; ABS. ENG; BIBL. 7 REF.Article

IMPROVED BOUNDS ON THE PROBLEM OF TIME-SPACE TRADE-OFF IN THE PEBBLE GAMEREISCHUK R.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 839-849; BIBL. 7 REF.Article

PARALLEL SORTING WITH CONSTANT TIME FOR COMPARISONSHAEGGKVIST R; HELL P.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 465-472; BIBL. 9 REF.Article

EQUIVALENCE OF FREE BOOLEAN GRAPHS CAN BE DECIDED PROBABILISTICALLY IN POLYNOMIAL TIMEBLUM M; CHANDRA AK; WEGMAN MN et al.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 80-82; BIBL. 5 REF.Article

MINIMIZING MAXIMUM FLOWS IN LINEAR GRAPHSSTANAT DF; MAGO GA.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 4; PP. 333-361; BIBL. 5 REF.Article

COMPUTER PROGRAM FOR APPROXIMATING THE RELIABILITY CHARACTERISTICS OF ACYCLIC DIRECTED GRAPHS.PEARSON GDM.1977; I.E.E.E. TRANS. RELIABIL.; U.S.A.; DA. 1977; VOL. 26; NO 1; PP. 32-38; BIBL. 16 REF.Article

COUNTING UNLABELED ACYCLIC DIGRAPHS.ROBINSON RW.1977; LECTURE NOTES MATH.; GERM.; DA. 1977; NO 622; PP. 28-43; BIBL. 8 REF.; (COMBINATORIAL MATH. AUST. CONF. 5. PROC.; MELBOURNE; 1976)Conference Paper

Acyclic molecules with second maximal energyJIANPING OU.Applied mathematics letters. 2010, Vol 23, Num 4, pp 343-346, issn 0893-9659, 4 p.Article

SEQUENTIAL EVALUATION OF TERMINAL PAIR RELIABILITY IN A RELIABILITY NETWORKSANTOSH KUMAR.1982; MICROELECTRON. RELIAB.; ISSN 0026-2714; GBR; DA. 1982; VOL. 22; NO 2; PP. 151-162; BIBL. 15 REF.Article

ASYMPTOTICALLY TIGHT BOUNDS ON TIME-SPACE TRADE-OFFS IN A PEBBLE GAMELENGAUER T; TARJAN RE.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1087-1130; BIBL. 34 REF.Article

AUTOMATES FINIS SUR LA FERMETURE RECURSIVE DES GRAPHES FINISRED'KO SE.1981; DOKL.-AKAD. NAUK UKR. SSR, SER. A; ISSN 0201-8446; UKR; DA. 1981; NO 5; PP. 86-88; ABS. ENG; BIBL. 5 REF.Article

GRAPH PEBBLING WITH MANY FREE PEBBLES CAN BE DIFFICULTCARLSON DA; SAVAGE JE.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 326-332; BIBL. 13 REF.Conference Paper

PARALLEL AND TWO-WAY RECOGNIZERS OF DIRECTED ACYCLIC GRAPHS (EXTENDED ABSTRACT)KAMIMURA T; SLUTZKI G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 317-325; BIBL. 16 REF.Conference Paper

DETERMINATION DE TOUS LES CHEMINS DANS UN GRAPHE ACYCLIQUE ORIENTEGARKAVENKO SI; BERDNIKOVA LS.1979; KIBERNETIKA; UKR; DA. 1979; NO 4; PP. 49-52; ABS. ENG; BIBL. 3 REF.Article

FREEDOM FROM DEADLOCK OF SAFE LOCKING POLICIESYANNAKAKIS M.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 391-408; BIBL. 17 REF.Article

THE STOCHASTIC SHORTEST ROUTE PROBLEMSIGAL CE; PRITSKER AAB; SOLBERG JJ et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1122-1129; BIBL. 16 REF.Article

VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEMDOWNEY PJ; SETHI R; TARJAN RE et al.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 758-771; BIBL. 21 REF.Article