scientific article; zbMATH DE number 3409391

zbMATH Open0259.05116MaRDI QIDQ5675746FDOQ5675746

R. W. Robinson

Publication date: 1973

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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 (39)

• Counting acyclic digraphs by sources and sinks
• \textit{Graph\_sampler}: a simple tool for fully Bayesian analyses of DAG-models
• Priors on network structures. Biasing the search for Bayesian networks
• Minimal strong digraphs
• Title not available (Why is that?)
• A novel discrete particle swarm optimization algorithm for solving bayesian network structures learning problem
• Asymptotic enumeration of compacted binary trees of bounded right height
• Counting extensional acyclic digraphs
• A Comparison of Random Task Graph Generation Methods for Scheduling Problems
• Uniform random generation of large acyclic digraphs
• Acyclic orientations and the chromatic polynomial
• The size distribution for Markov equivalence classes of acyclic digraph models.
• On the number of labeled acyclic digraphs
• Maximal bifix codes of degree 3
• Exact enumeration of satisfiable 2-SAT formulae
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Zeros of the deformed exponential function
• Formulas for counting acyclic digraph Markov equivalence classes
• Corrected score methods for estimating Bayesian networks with error-prone nodes
• On expressiveness of the chain graph interpretations
• Parallel globally optimal structure learning of Bayesian networks
• From statistical to causal learning
• Generating functions of some families of directed uniform hypergraphs
• Chain graph models to elicit the structure of a Bayesian network
• Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
• DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS
• Acyclic Digraphs
• Structural factor equation models for causal network construction via directed acyclic mixed graphs
• Generating connected acyclic digraphs uniformly at random
• Marginal information for structure learning
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Counting acyclic and strong digraphs by descents
• Asymptotic enumeration of extensional acyclic digraphs
• Inferring large graphs using \(\ell_1\)-penalized likelihood
• Efficient Sampling and Structure Learning of Bayesian Networks
• Who should cast the casting vote? Using sequential voting to amalgamate information
• The birth of the strong components
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Multi-dimensional classification with Bayesian networks

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)