2003Acta Scicentiarum Naturalum Universitis PekinesisRequires access

The Structure and Determination of the Set of Reversible Edges in a Directed Acyclic Graph

Jing Xu

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Directed acyclic graph, Directed graph, Feedback arc set, Combinatorics, Graph, Mixed graph, Moral graph, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
The Structure and Determination of the Set of Reversible Edges in a Directed Acyclic Graph — Research Paper | ScholarLens