The marginal factorization of Bayesian networks and its applicationDAN WU; WONG, Michael.International journal of intelligent systems. 2004, Vol 19, Num 8, pp 769-786, issn 0884-8173, 18 p.Article

The 2-linkage problem for acyclic digraphsTHOMASSEN, C.Discrete mathematics. 1985, Vol 55, Num 1, pp 73-87, issn 0012-365XArticle

Connections in acyclic hypergraphsMAIER, D; ULLMAN, J. D.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 185-199, issn 0304-3975Article

Jump number of dags having dilworth number 2CHEIN, M; HABIB, M.Discrete applied mathematics. 1984, Vol 7, Num 3, pp 243-250, issn 0166-218XArticle

on metapaths in metagraphsCULIK, K.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 4, pp 551-568, issn 0196-5212Article

Path partitions and packs of acyclic digraphsAHARONI, R; BEN-ARROYO-HARTMAN, I; HOFFMAN, A. J et al.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 249-259, issn 0030-8730Article

SUFFIX ORDERING AND MORPHOLOGICAL PROCESSING = AGENCEMENT DU SUFFIXE ET TRAITEMENT MORPHOLOGIQUEPLAG, Ingo; BAAYEN, Harald.Language (Baltimore). 2009, Vol 85, Num 1, pp 109-152, issn 0097-8507, 44 p.Article

On the number of descendants in an object DAGSHIDLOVSKY, B; BERTINO, E.Information processing letters. 1996, Vol 58, Num 5, pp 211-216, issn 0020-0190Article

Facets of the linear ordering polytopeGROTSCHEL, M; JUNGER, M; REINELT, G et al.Mathematical programming. 1985, Vol 33, Num 1, pp 43-60, issn 0025-5610Article

A tile-based coordination view of asynchronous π-calculusFERRARI, G; MONTANARI, U.Lecture notes in computer science. 1997, pp 52-70, issn 0302-9743, isbn 3-540-63437-1Conference Paper

SHAPE : a machine learning system from examplesBOTANA, F; BAHAMONDE, A.International journal of human-computer studies. 1995, Vol 42, Num 2, pp 137-155, issn 1071-5819Article

Approximations for the maximum acyclic subgraph problemHASSIN, R; RUBINSTEIN, S.Information processing letters. 1994, Vol 51, Num 3, pp 133-140, issn 0020-0190Article

EXTENDING GREENE'S THEOREM TO DIRECTED GRAPHSHOFFMAN AJ.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 1; PP. 102-107; BIBL. 7 REF.Article

Hierarchical Constraint Satisfaction based on subdefinite modelsUSHAKOV, Dmitry.Lecture notes in computer science. 2001, pp 434-445, issn 0302-9743, isbn 3-540-43075-XConference Paper

Labelling and implicit routing in networksSENTORO, N; KHATIB, R.Computer journal (Print). 1985, Vol 28, Num 1, pp 5-8, issn 0010-4620Article

On the acyclic subgraph polytopeGROTSCHEL, M; JUNGER, M; REINELT, G et al.Mathematical programming. 1985, Vol 33, Num 1, pp 28-42, issn 0025-5610Article

EXPLICIT CONSTRUCTIONS OF LINEAR-SIZED SUPERCONCENTRATORSGABBER O; GALIL Z.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 407-420; BIBL. 9 REF.Article

A parallel search algorithm for directed acyclic graphsGHOSH, R. K; BHATTACHARJEE, G. P.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 2, pp 134-150, issn 0006-3835Article

On instruction sets and their formatsFLYNN, M. J; JOHNSON, J. D; WAKEFIELD, S. P et al.IEEE transactions on computers. 1985, Vol 34, Num 3, pp 242-254, issn 0018-9340Article

On the existence of acyclic views in a database schemeAUSIELLO, G; D'ATRI, A; MOSCARINI, M et al.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 165-177, issn 0304-3975Article

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

A new approximation algorithm for the register allocation problemJANSEN, K; REITER, J.Lecture notes in computer science. 1997, pp 135-146, issn 0302-9743, isbn 3-540-63138-0Conference Paper

Direct construction of Compact Directed Acyclic Word graphsCROCHEMORE, M; VERIN, R.Lecture notes in computer science. 1997, pp 116-129, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Multi-processor scheduling and expandersKUZJURIN, N. N.Information processing letters. 1994, Vol 51, Num 6, pp 315-319, issn 0020-0190Article

Speeding up dynamic transitive closure for bounded degree graphsYELLIN, D. M.Acta informatica. 1993, Vol 30, Num 4, pp 369-384, issn 0001-5903Article