De Panafieu, Élie; Dovgal, Sergey Counting directed acyclic and elementary digraphs. (English) Zbl 1452.05087 Sémin. Lothar. Comb. 84B, 84B.2, 12 p. (2020). Reviewer: Xueliang Li (Tianjin) MSC: 05C30 05C20 05C80 05D40 PDF BibTeX XML Cite \textit{É. De Panafieu} and \textit{S. Dovgal}, Sémin. Lothar. Comb. 84B, 84B.2, 12 p. (2020; Zbl 1452.05087) Full Text: Link
Sondhi, Arjun; Shojaie, Ali The reduced PC-algorithm: improved causal structure learning in large random networks. (English) Zbl 1446.62256 J. Mach. Learn. Res. 20, Paper No. 164, 31 p. (2019). MSC: 62M40 62H22 60G60 05C90 62-08 62P10 PDF BibTeX XML Cite \textit{A. Sondhi} and \textit{A. Shojaie}, J. Mach. Learn. Res. 20, Paper No. 164, 31 p. (2019; Zbl 1446.62256) Full Text: Link
Wallner, Michael A bijection of plane increasing trees with relaxed binary trees of right height at most one. (English) Zbl 1441.05051 Theor. Comput. Sci. 755, 1-12 (2019). MSC: 05C05 05C10 05C78 05C30 11B39 PDF BibTeX XML Cite \textit{M. Wallner}, Theor. Comput. Sci. 755, 1--12 (2019; Zbl 1441.05051) Full Text: DOI
Satake, Shohei; Sawa, Masanori; Jimbo, Masakazu Erdős-Rényi theory for asymmetric digraphs. (English) Zbl 1422.05095 SUT J. Math. 54, No. 2, 109-129 (2018). MSC: 05C80 05C20 PDF BibTeX XML Cite \textit{S. Satake} et al., SUT J. Math. 54, No. 2, 109--129 (2018; Zbl 1422.05095)
Iriarte, Benjamin Graph orientations and linear extensions. (English) Zbl 1386.90127 Math. Oper. Res. 42, No. 4, 1219-1229 (2017). MSC: 90C27 90C35 05C20 05C21 05C80 90C57 PDF BibTeX XML Cite \textit{B. Iriarte}, Math. Oper. Res. 42, No. 4, 1219--1229 (2017; Zbl 1386.90127) Full Text: DOI
Dutta, Kunal; Subramanian, C. R. Improved bounds on induced acyclic subgraphs in random digraphs. (English) Zbl 1345.05094 SIAM J. Discrete Math. 30, No. 3, 1848-1865 (2016). MSC: 05C80 05C20 05C35 PDF BibTeX XML Cite \textit{K. Dutta} and \textit{C. R. Subramanian}, SIAM J. Discrete Math. 30, No. 3, 1848--1865 (2016; Zbl 1345.05094) Full Text: DOI
Kuipers, Jack; Moffa, Giusi Uniform random generation of large acyclic digraphs. (English) Zbl 1331.62150 Stat. Comput. 25, No. 2, 227-242 (2015). MSC: 62F15 05C20 65C40 PDF BibTeX XML Cite \textit{J. Kuipers} and \textit{G. Moffa}, Stat. Comput. 25, No. 2, 227--242 (2015; Zbl 1331.62150) Full Text: DOI arXiv
Carstens, Corrie Jacobien A uniform random graph model for directed acyclic networks and its effect on motif-finding. (English) Zbl 1397.05163 J. Complex Netw. 2, No. 4, 419-430 (2014). MSC: 05C80 05C82 PDF BibTeX XML Cite \textit{C. J. Carstens}, J. Complex Netw. 2, No. 4, 419--430 (2014; Zbl 1397.05163) Full Text: DOI
Shang, Yilun Group pinning consensus under fixed and randomly switching topologies with acyclic partition. (English) Zbl 1300.93017 Netw. Heterog. Media 9, No. 3, 553-573 (2014). MSC: 93A14 93C05 37H10 05C20 05C50 60J27 PDF BibTeX XML Cite \textit{Y. Shang}, Netw. Heterog. Media 9, No. 3, 553--573 (2014; Zbl 1300.93017) Full Text: DOI
Bonato, Anthony; Mitsche, Dieter; Prałat, Paweł Vertex-pursuit in random directed acyclic graphs. (English) Zbl 1272.05178 SIAM J. Discrete Math. 27, No. 2, 732-756 (2013). MSC: 05C80 05C57 94C15 PDF BibTeX XML Cite \textit{A. Bonato} et al., SIAM J. Discrete Math. 27, No. 2, 732--756 (2013; Zbl 1272.05178) Full Text: DOI
Moler, José; Plo, Fernando; Urmeneta, Henar A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits. (English) Zbl 1262.60025 Test 22, No. 1, 46-61 (2013). MSC: 60F05 60F15 68R10 05C20 PDF BibTeX XML Cite \textit{J. Moler} et al., Test 22, No. 1, 46--61 (2013; Zbl 1262.60025) Full Text: DOI
Rizzi, Romeo; Tomescu, Alexandru I. Ranking, unranking and random generation of extensional acyclic digraphs. (English) Zbl 1259.05172 Inf. Process. Lett. 113, No. 5-6, 183-187 (2013). MSC: 05C85 05C20 PDF BibTeX XML Cite \textit{R. Rizzi} and \textit{A. I. Tomescu}, Inf. Process. Lett. 113, No. 5--6, 183--187 (2013; Zbl 1259.05172) Full Text: DOI
Broutin, Nicolas; Fawzi, Omar Longest path distance in random circuits. (English) Zbl 1252.05049 Comb. Probab. Comput. 21, No. 6, 856-881 (2012). MSC: 05C12 05C38 05C80 94C05 60C05 05C05 94D99 PDF BibTeX XML Cite \textit{N. Broutin} and \textit{O. Fawzi}, Comb. Probab. Comput. 21, No. 6, 856--881 (2012; Zbl 1252.05049) Full Text: DOI arXiv
Korenblit, Mark; Levit, Vadim E. Mincuts in generalized Fibonacci graphs of degree 3. (English) Zbl 1248.05193 J. Comput. Methods Sci. Eng. 11, No. 5-6, 271-280 (2011). MSC: 05C82 05C80 PDF BibTeX XML Cite \textit{M. Korenblit} and \textit{V. E. Levit}, J. Comput. Methods Sci. Eng. 11, No. 5--6, 271--280 (2011; Zbl 1248.05193) Full Text: Link
Dutta, Kunal; Subramanian, C. R. Induced acyclic subgraphs in random digraphs: improved bounds. (English) Zbl 1355.05224 Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 159-174 (2010). MSC: 05C80 05C20 PDF BibTeX XML Cite \textit{K. Dutta} and \textit{C. R. Subramanian}, in: Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'10), Vienna, Austria, June 28 -- July 2, 2010. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 159--174 (2010; Zbl 1355.05224) Full Text: Link
Baioletti, Marco; Busanello, Giuseppe; Vantaggi, Barbara An algorithm to find a perfect map for graphoid structures. (English) Zbl 1213.68614 Hüllermeier, Eyke (ed.) et al., Information processing and management of uncertainty in knowledge-based systems. Theory and methods. 13th international conference, IPMU 2010, Dortmund, Germany, June 28–July 2, 2010. Proceedings. Part I. Berlin: Springer (ISBN 978-3-642-14054-9/pbk; 978-3-642-14055-6/ebook). Communications in Computer and Information Science 80, 1-10 (2010). MSC: 68T35 68P05 68R10 68Q87 PDF BibTeX XML Cite \textit{M. Baioletti} et al., Commun. Comput. Inf. Sci. 80, 1--10 (2010; Zbl 1213.68614) Full Text: DOI
Dutta, Kunal; Subramanian, C. R. Largest induced acyclic tournament in random digraphs: a 2-point concentration. (English) Zbl 1283.05248 López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 627-637 (2010). MSC: 05C80 05C20 05C85 68W40 PDF BibTeX XML Cite \textit{K. Dutta} and \textit{C. R. Subramanian}, Lect. Notes Comput. Sci. 6034, 627--637 (2010; Zbl 1283.05248) Full Text: DOI
Balabanov, A. S. Construction of minimal \(d\)-separators in a dependency system. (English. Russian original) Zbl 1216.05045 Cybern. Syst. Anal. 45, No. 5, 703-713 (2009); translation from Kibern. Sist. Anal. 2009, No. 5, 38-50 (2009). MSC: 05C20 05C80 68T30 PDF BibTeX XML Cite \textit{A. S. Balabanov}, Cybern. Syst. Anal. 45, No. 5, 703--713 (2009; Zbl 1216.05045); translation from Kibern. Sist. Anal. 2009, No. 5, 38--50 (2009) Full Text: DOI
Spencer, Joel; Subramanian, C. R. On the size of induced acyclic subgraphs in random digraphs. (English) Zbl 1196.05091 Discrete Math. Theor. Comput. Sci. 10, No. 2, 47-54 (2008). MSC: 05C80 05C20 PDF BibTeX XML Cite \textit{J. Spencer} and \textit{C. R. Subramanian}, Discrete Math. Theor. Comput. Sci. 10, No. 2, 47--54 (2008; Zbl 1196.05091) Full Text: Link
Melançon, Guy; Philippe, Fabrice Generating connected acyclic digraphs uniformly at random. (English) Zbl 1177.68155 Inf. Process. Lett. 90, No. 4, 209-213 (2004). MSC: 68R10 05C20 05C80 05C85 PDF BibTeX XML Cite \textit{G. Melançon} and \textit{F. Philippe}, Inf. Process. Lett. 90, No. 4, 209--213 (2004; Zbl 1177.68155) Full Text: DOI
Huang, Hsin-Cheng; Cressie, Noel Asymptotic properties of maximum (composite) likelihood estimators for partially ordered Markov models. (English) Zbl 0960.62107 Stat. Sin. 10, No. 4, 1325-1344 (2000). MSC: 62M40 62F12 62M05 60F05 PDF BibTeX XML Cite \textit{H.-C. Huang} and \textit{N. Cressie}, Stat. Sin. 10, No. 4, 1325--1344 (2000; Zbl 0960.62107)
Cressie, Noel; Davidson, Jennifer L. Image analysis with partially ordered Markov models. (English) Zbl 1042.62611 Comput. Stat. Data Anal. 29, No. 1, 1-26 (1998). MSC: 62M40 PDF BibTeX XML Cite \textit{N. Cressie} and \textit{J. L. Davidson}, Comput. Stat. Data Anal. 29, No. 1, 1--26 (1998; Zbl 1042.62611) Full Text: DOI
Dondajewski, Marian; Szymański, Jerzy Vertices of small degrees in random recursive dags. (English) Zbl 0910.05060 Fasc. Math. 28, 31-41 (1998). Reviewer: O.Frank (Stockholm) MSC: 05C80 05C20 05C05 PDF BibTeX XML Cite \textit{M. Dondajewski} and \textit{J. Szymański}, Fasc. Math. 28, 31--41 (1998; Zbl 0910.05060)
Prodinger, Helmut Comments on the analysis of parameters in a random graph model. (English) Zbl 0834.68091 RAIRO, Inform. Théor. Appl. 29, No. 3, 245-253 (1995). MSC: 68R10 68W10 PDF BibTeX XML Cite \textit{H. Prodinger}, RAIRO, Inform. Théor. Appl. 29, No. 3, 245--253 (1995; Zbl 0834.68091) Full Text: DOI EuDML
Brightwell, G. R.; Kohayakawa, Y. Ramsey properties of orientations of graphs. (English) Zbl 0794.05083 Random Struct. Algorithms 4, No. 4, 413-428 (1993). Reviewer: A.Ruciński (Poznań) MSC: 05C55 05C20 05C80 05C05 PDF BibTeX XML Cite \textit{G. R. Brightwell} and \textit{Y. Kohayakawa}, Random Struct. Algorithms 4, No. 4, 413--428 (1993; Zbl 0794.05083) Full Text: DOI
Afrati, F.; Stafylopatis, A. Performance considerations on a random graph model for parallel processing. (English) Zbl 0778.68017 RAIRO, Inform. Théor. Appl. 27, No. 4, 367-388 (1993). MSC: 68M20 68Q10 68R10 PDF BibTeX XML Cite \textit{F. Afrati} and \textit{A. Stafylopatis}, RAIRO, Inform. Théor. Appl. 27, No. 4, 367--388 (1993; Zbl 0778.68017) Full Text: DOI EuDML
Łuczak, Tomasz; Cohen, Joel E. Stratigraphy of a random acyclic directed graph: The size of trophic levels in the cascade model. (English) Zbl 0790.05076 Ann. Appl. Probab. 3, No. 2, 403-420 (1993). Reviewer: W.Schlee (München) MSC: 05C80 05C20 92D40 PDF BibTeX XML Cite \textit{T. Łuczak} and \textit{J. E. Cohen}, Ann. Appl. Probab. 3, No. 2, 403--420 (1993; Zbl 0790.05076) Full Text: DOI
Ghosh, R. K. Parallel search algorithms for graphs and trees. (English) Zbl 0764.68050 Inf. Sci. 67, No. 1-2, 137-165 (1993). MSC: 68W15 68R10 05C05 05C85 05C70 PDF BibTeX XML Cite \textit{R. K. Ghosh}, Inf. Sci. 67, No. 1--2, 137--165 (1993; Zbl 0764.68050) Full Text: DOI
Cohen, Joel E. Möbius inversion of random acyclic directed graphs. (English) Zbl 0716.05024 Stud. Appl. Math. 84, No. 1, 1-6 (1991). MSC: 05C20 05C80 15A09 PDF BibTeX XML Cite \textit{J. E. Cohen}, Stud. Appl. Math. 84, No. 1, 1--6 (1991; Zbl 0716.05024) Full Text: DOI
Amamiya, Makoto; Mine, Tsunenori An \(O(n)\) time and \(O(n^ 2)\) processors parallel parsing algorithm for context-free grammars. (English) Zbl 0862.68058 Jaakkola, Hannu (ed.) et al., Advances in information modelling and knowledge bases. Amsterdam etc.: IOS Press. Front. Artif. Intell. Appl. 10, 351-367 (1991). MSC: 68W15 68Q42 PDF BibTeX XML Cite \textit{M. Amamiya} and \textit{T. Mine}, Front. Artif. Intell. Appl. 10, 351--367 (1991; Zbl 0862.68058)
Speckenmeyer, Ewald On feedback problems in digraphs. (English) Zbl 0768.68181 Graph-theoretic concepts in computer science, Proc. 15th Int. Workshop, WG ’89, Castle Rolduc/Neth. 1989, Lect. Notes Comput. Sci. 411, 218-231 (1990). MSC: 68R10 68Q25 05C20 60G50 PDF BibTeX XML Cite \textit{E. Speckenmeyer}, Lect. Notes Comput. Sci. 411, 218--231 (1990; Zbl 0768.68181)
McKay, Brendan D. On the shape of a random acyclic digraph. (English) Zbl 0702.05040 Math. Proc. Camb. Philos. Soc. 106, No. 3, 459-465 (1989). Reviewer: Wai-Kai Chen MSC: 05C20 05C80 PDF BibTeX XML Cite \textit{B. D. McKay}, Math. Proc. Camb. Philos. Soc. 106, No. 3, 459--465 (1989; Zbl 0702.05040) Full Text: DOI
Simon, Klaus An improved algorithm for transitive closure on acyclic digraphs. (English) Zbl 0656.68047 Theor. Comput. Sci. 58, No. 1-3, 325-346 (1988). Reviewer: M.Křivánek MSC: 68Q25 05C20 68R10 PDF BibTeX XML Cite \textit{K. Simon}, Theor. Comput. Sci. 58, No. 1--3, 325--346 (1988; Zbl 0656.68047) Full Text: DOI
Fernandez de la Vega, W. On the maximum cardinality of a consistent set of arcs in a random tournament. (English) Zbl 0531.05036 J. Comb. Theory, Ser. B 35, 328-332 (1983). Reviewer: J.W.Moon MSC: 05C20 05C80 60C05 PDF BibTeX XML Cite \textit{W. Fernandez de la Vega}, J. Comb. Theory, Ser. B 35, 328--332 (1983; Zbl 0531.05036) Full Text: DOI
Blum, Manuel; Chandra, Ashok K.; Wegman, Mark N. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. (English) Zbl 0444.68059 Inf. Process. Lett. 10, 80-82 (1980). MSC: 68R10 68Q25 68Q60 PDF BibTeX XML Cite \textit{M. Blum} et al., Inf. Process. Lett. 10, 80--82 (1980; Zbl 0444.68059) Full Text: DOI