The hardness of the independence and matching clutter of a graph
暂无分享,去创建一个
[1] D. West. Introduction to Graph Theory , 1995 .
[2] G. Cornuéjols,et al. Combinatorial optimization : packing and covering , 2001 .
[3] David P. Summer. Randomly matchable graphs , 1979, J. Graph Theory.
[4] Jens Christian Claussen,et al. Offdiagonal complexity: A computationally quick complexity measure for graphs and networks , 2004, q-bio/0410024.
[5] Stasys Jukna,et al. On Graph Complexity , 2006, Combinatorics, Probability and Computing.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .