Recognizing Polymatroids Associated with Hypergraphs
暂无分享,去创建一个
[1] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[2] W. T. Tutte. An algorithm for determining whether a given binary matroid is graphic. , 1960 .
[3] Paul D. Seymour,et al. Recognizing graphic matroids , 1981 .
[4] Geoff Whittle,et al. A geometric theory of hypergraph colouring , 1991 .
[5] H. Whitney. 2-Isomorphic Graphs , 1933 .
[6] D. Welsh,et al. The computational complexity of matroid properties , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.
[7] Michael R. Fellows,et al. Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.