The Structure and Determination of the Set of Reversible Edges in a Directed Acyclic Graph
Jing Xu
Abstract
Jing Xu
Abstract
Authors have studied the structure of R G,which is the set of reversible edges of a dag(directed acyclic graph) G and present the sufficient and necessary condition to determine R G.This result can help to search the equivalent classes of a dag and be used in the learning of Bayesian Network.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Authors have studied the structure of R G,which is the set of reversible edges of a dag(directed acyclic graph) G and present the sufficient and necessary condition to determine R G.This result can help to search the equivalent classes of a dag and be used in the learning of Bayesian Network.
Key concepts: Directed acyclic graph, Directed graph, Feedback arc set, Combinatorics, Graph, Mixed graph, Moral graph, Mathematics