A Poset Dimension Algorithm
暂无分享,去创建一个
[1] William T. Trotter,et al. Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension , 1976, Discret. Math..
[2] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .
[3] Stephen B. Maurer,et al. Large minimal realizers of a partial order , 1977 .
[4] Klaus Reuter. Removing critical pairs , 1989 .
[5] O. Ore. Theory of Graphs , 1962 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] William T. Trotter,et al. Dimension Theory for Ordered Sets , 1982 .
[8] William T. Trotter,et al. Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..
[9] Ben Dushnik,et al. Partially Ordered Sets , 1941 .
[10] David Kelly. The 3-Irreducible Partially Ordered Sets , 1977, Canadian Journal of Mathematics.
[11] W. Trotter,et al. Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .
[12] William T. Trotter,et al. The dimension of a comparability graph , 1976 .
[13] William J. Cook,et al. Combinatorial optimization , 1997 .
[14] Peter C. Fishburn,et al. Posets with large dimension and relatively few critical pairs , 1993 .
[15] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[16] Douglas B. West,et al. Parameters of Partial Orders and Graphs: Packing, Covering, and Representation , 1985 .