A new notion of convexity in digraphs with an application to Bayesian networks
From MaRDI portal
Publication:5347248
DOI10.1142/S1793830917500161zbMath1362.05054OpenAlexW2568521801MaRDI QIDQ5347248
Publication date: 23 May 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500161
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Axiomatic and generalized convexity (52A01) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalence between hypergraph convexities
- Artificial life and computational intelligence. Second Australasian conference, ACALCI 2016, Canberra, ACT, Australia, February 2--5, 2016. Proceedings
- Pruning processes and a new characterization of convex geometries
- Canonical and monophonic convexities in hypergraphs
- The theory of convex geometries
- The hull number of a graph
- Closure systems and their structure
- Closure spaces that are not uniquely generated
- Closure lattices
- Computing simple-path convex hulls in hypergraphs
- Decomposability of abstract and path-induced convexities in hypergraphs
- Convexity in directed graphs
- The Role of Continuous Processes in Cognitive Development
- Geodesic Convexity in Graphs
- Convexity in Graphs and Hypergraphs
- Independence properties of directed markov fields
- Identifying independence in bayesian networks