scientific article; zbMATH DE number 3409391
From MaRDI portal
Publication:5675746
Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of functional-differential equations (34K05)
Cited in
(42)- Counting acyclic digraphs by sources and sinks
- Discrete metric spaces: structure, enumeration, and 0-1 laws
- Priors on network structures. Biasing the search for Bayesian networks
- Minimal strong digraphs
- \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models
- Asymptotic enumeration of compacted binary trees of bounded right height
- Counting extensional acyclic digraphs
- Lifted inference beyond first-order logic
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Uniform random generation of large acyclic digraphs
- Acyclic orientations and the chromatic polynomial
- On the number of labeled acyclic digraphs
- Maximal bifix codes of degree 3
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Zeros of the deformed exponential function
- Exact enumeration of satisfiable 2-SAT formulae
- Formulas for counting acyclic digraph Markov equivalence classes
- Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
- Acyclic digraphs
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Random generation of essential directed acyclic graphs
- On expressiveness of the chain graph interpretations
- Parallel globally optimal structure learning of Bayesian networks
- Generating functions of some families of directed uniform hypergraphs
- From statistical to causal learning
- Chain graph models to elicit the structure of a Bayesian network
- A novel discrete particle swarm optimization algorithm for solving Bayesian network structures learning problem
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
- Generating connected acyclic digraphs uniformly at random
- Structural factor equation models for causal network construction via directed acyclic mixed graphs
- Marginal information for structure learning
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Asymptotic enumeration of extensional acyclic digraphs
- Counting acyclic and strong digraphs by descents
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Hiring strategies
- Who should cast the casting vote? Using sequential voting to amalgamate information
- Multi-dimensional classification with Bayesian networks
- Efficient Sampling and Structure Learning of Bayesian Networks
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
- A comparison of random task graph generation methods for scheduling problems
- The birth of the strong components
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675746)
