Retiming DAGs [direct acyclic graph].
Pierre-Yves CallandAnne MignotteOlivier PeyranYves RobertFrédéric VivienPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1998)
Keyphrases
- directed acyclic graph
- markov equivalence classes
- equivalence classes
- equivalence class
- directed graph
- random walk
- connected graphs
- stable set
- undirected graph
- np complete
- belief networks
- bipartite graph
- graph structure
- np hard
- graph theory
- connected components
- conditional independence
- graph partitioning
- graph theoretic
- graph databases
- graph model
- graph search
- dependency graph
- database schemes
- image segmentation