Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient algorithm for finding the largest chain graph according to a given chain graph

From MaRDI portal
Publication:880872
Jump to:navigation, search

zbMath1117.60010MaRDI QIDQ880872

Zhongguo Zheng, Hui Zhao, Baijun Liu

Publication date: 29 May 2007

Published in: Science in China. Series A (Search for Journal in Brave)


zbMATH Keywords

efficient algorithmchain graphgraphical Markov modellargest chain graphprotected arrows


Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic measure theory (60A10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (1)

Chain graph interpretations and their relations revisited







This page was built for publication: An efficient algorithm for finding the largest chain graph according to a given chain graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:880872&oldid=12836962"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 15:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki