A new notion of convexity in digraphs with an application to Bayesian networks (Q5347248): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning processes and a new characterization of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying independence in bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure spaces that are not uniquely generated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence properties of directed markov fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical and monophonic convexities in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing simple-path convex hulls in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between hypergraph convexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposability of abstract and path-induced convexities in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Convexity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Continuous Processes in Cognitive Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Artificial life and computational intelligence. Second Australasian conference, ACALCI 2016, Canberra, ACT, Australia, February 2--5, 2016. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure systems and their structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830917500161 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568521801 / rank
 
Normal rank

Latest revision as of 09:41, 30 July 2024

scientific article; zbMATH DE number 6722492
Language Label Description Also known as
English
A new notion of convexity in digraphs with an application to Bayesian networks
scientific article; zbMATH DE number 6722492

    Statements

    A new notion of convexity in digraphs with an application to Bayesian networks (English)
    0 references
    23 May 2017
    0 references
    convexity
    0 references
    digraphs
    0 references
    Bayesian networks
    0 references
    Markov properties
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references