共 50 条
- [1] Finding an Unknown Acyclic Orientation of a Given GraphCOMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (01): : 121 - 131Pikhurko, Oleg
- [2] An efficient algorithm for finding the largest chain graph according to a given chain graphScienceinChina,SerA., 2005, Ser.A.2005 (11) : 1517 - 1530LIU BaijunZHENG Zhongguo ZHAO Hui School of Mathematical Sciences Peking University Beijing ChinaDepartment of Statistics Central China Normal University Wuhan China
- [3] An efficient algorithm for finding the largest chain graph according to a given chain graphScience China Mathematics, 2005, (11) : 1517 - 1530LIU BaijunDepartment of Statistics
- [4] An efficient algorithm for finding the largest chain graph according to a given chain graphScience in China Series A: Mathematics, 2005, 48 : 1517 - 1530Baijun LiuZhongguo ZhengHui Zhao
- [5] An efficient algorithm for finding the largest chain graph according to a given chain graphSCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 48 (11): : 1517 - 1530Liu, BJZheng, ZGZhao, H
- [6] REALIZATION OF A LINEAR GRAPH GIVEN ITS ALGEBRAIC SPECIFICATIONJOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA, 1961, 33 (09): : 1183 - &AUSLANDER, LTRENT, HM
- [7] Finding the optimal Bayesian network given a constraint graphPEERJ COMPUTER SCIENCE, 2017,Schreiber, Jacob M.Noble, William S.
- [8] An algebraic approach for finding disjoint paths in the alternating group graphJournal of Combinatorial Mathematics and Combinatorial Computing, 2008, 64 : 109 - 119Department of Mathematics and Computer Science, University of Detroit Mercy, Detroit, MI 48221, United States
- [10] MINIMAL REGULAR GRAPH CONTAINING A GIVEN GRAPHAPPLIED MATHEMATICS LETTERS, 1992, 5 (01) : 3 - 5SHASTRI, A